Some convex programs without a duality gap

An important issue in convex programming concerns duality gap. Various conditions have been developed over the years that guarantee no duality gap, including one developed by Rockafellar (Network flows and monotropic programming. Wiley-Interscience, New York, 1984)involving separable objective function and affine constraints. We show that this sufficient condition can be further relaxed to allow the constraint functions to be separable. We also refine a sufficient condition involving weakly analytic functions by allowing them to be extended-real-valued.

[1]  J. Borwein,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

[2]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[3]  H. Wolkowicz,et al.  Method of reduction in convex programming , 1983 .

[4]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[5]  R. Rockafellar.  Some Convex Programs Whose Duals Are Linearly Constrained , 1970 .

[6]  Paul Tseng,et al.  An epsilon-out-of-Kilter Method for Monotropic Programming , 2001, Math. Oper. Res..

[7]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .

[8]  K. Kiwiel.  Proximal Minimization Methods with Generalized Bregman Functions , 1997 .

[9]  E. Gol′šteĭn,et al.  Theory of Convex Programming , 1972 .

[10]  Vaithilingam Jeyakumar,et al.  Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming , 2005 .

[11]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[12]  Michael Zibulevsky,et al.  Penalty/Barrier Multiplier Methods for Convex Programming Problems , 1997, SIAM J. Optim..

[13]  R. Rockafellar.  Ordinary convex programs without a duality gap , 1971 .

[14]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

[15]  Lisa A. Korf,et al.  Stochastic programming duality: ∞ multipliers for unbounded constraints with an application to mathematical finance , 2004, Math. Program..

[16]  M. Teboulle,et al.  Asymptotic cones and functions in optimization and variational inequalities , 2002 .

[17]  T. Champion,et al.  Duality gap in convex programming , 2004, Math. Program..

[18]  Alfred Auslender,et al.  Existence of optimal solutions and duality results under weak conditions , 2000, Math. Program..

[19]  Michael J. Todd,et al.  Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems , 1999, Math. Program..

[20]  D. Klatte.  A sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities , 1984 .