Some convex programs without a duality gap

Mathematical Programming

Volumn 116, Issue 1-2, 2009, Pages 553-578

  Tseng, Paul ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Duality gap; Hoffman's error bound; Recession direction; Separable convex program; Weakly analytic function

Indexed keywords

AEROSPACE APPLICATIONS; COMPUTER NETWORKS; FISH; FUNCTIONS; GALLIUM ALLOYS; METROPOLITAN AREA NETWORKS; NETWORK PROTOCOLS; TRAJECTORIES; VARIATIONAL TECHNIQUES;

(I ,J) CONDITIONS; AFFINE CONSTRAINTS; CONSTRAINT FUNCTIONS; CONVEX OPTIMIZATION; CONVEX PROGRAMMING; CONVEX PROGRAMS; DUALITY GAPS; NETWORK FLOWS; NEW YORK (CO); OBJECTIVE FUNCTION (OF); SPRINGER (CO); SUFFICIENT CONDITIONS; VARIATIONAL INEQUALITIES; WEAKLY ANALYTIC FUNCTIONS;

THEOREM PROVING;

EID: 45749111441     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0110-z     Document Type: Article

References (24)

1. Auslender A. (2000). Existence of optimal solutions and duality results under weak conditions. Math. Program. 88: 45-59
2. Auslender A. and Teboulle M. (2003). Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer, New York
3. Bazaraa M.S., Sherali H.D. and Shetty C.M. (1993). Nonlinear Programming: Theory and Algorithms. Wiley, New York
4. Ben-Tal A. and Zibulevsky M. (1997). Penalty/barrier multiplier methods for convex programming problems. SIAM J. Optim. 7: 347-366
5. Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic, New York (1982); republished by Athena Scientific, Belmont (1999)
6. Bertsekas D.P. (1999). Nonlinear Programming, 2nd edn. Athena Scientific, Belmont
7. Bertsekas D.P., Nedić A. and Ozdaglar A.E. (2003). Convex Analysis and Optimization. Athena Scientific, Belmont
8. Borwein J.M. and Lewis A.S. (2000). Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, New York
9. Champion T. (2004). Duality gap in convex programming. Math. Program. 99: 487-498
10. Dinh N., Jeyakumar V. and Lee G.M. (2005). Sequential Lagrangian conditions for convex programs with applications to semidefinite programming. J. Optim. Theory Appl. 125: 85-112
11. Golstein, E.G.: Theory of Convex Programming. English translation by K. Makowski. American Mathematical Society, Providence (1972)
12. Hoffman A.J. (1952). On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49: 263-265
13. Kiwiel K.C. (1997). Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. 35: 1142-1168
14. Klatte D. (1984). sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities. Math. Program. Study 21: 139-149
15. ∞ multipliers for unbounded constraints with an application to mathematical finance. Math. Program. 99: 241-259
16. Kummer, B.: Stability and weak duality in convex programming without regularity. Wissenschaftliche Zeitschrift der Humboldt-Universität zu Berlin, Math. Nat. R. XXX, 381-386 (1981)
17. Nesterov Y., Todd M.J. and Ye Y. (1999). Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 84: 227-267
18. Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, Princeton
19. Rockafellar, R.T.: Some convex programs whose duals are linearly constrained. In: Rosen, J.B. et al (eds.) Nonlinear Programming, pp. 293-322. Academic, New York (1970)
20. Rockafellar R.T. (1971). Ordinary convex programs without a duality gap. J. Optim. Theory Appl. 7: 43-148
21. Rockafellar R.T. (1976). Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1: 97-116
22. Rockafellar, R.T.: Network Flows and Monotropic Programming. Wiley-Interscience, New York (1984); republished by Athena Scientific, Belmont (1998)
23. Tseng P. (2001). An ε-out-of-kilter method for monotropic programming problems. Math. Oper. Res. 26: 221-233
24. Wolkowicz H. (1983). Method of reduction in convex programming. J. Optim. Theory Appl. 40: 349-378