Abstract
In this paper it is shown that, in the absence of any regularity condition, sequential Lagrangian optimality conditions as well as a sequential duality results hold for abstract convex programs. The significance of the results is that they yield the standard optimality and duality results for convex programs under a simple closed-cone condition that is much weaker than the well-known constraint qualifications. As an application, a sequential Lagrangian duality, saddle-point conditions, and stability results are derived for convex semidefinite programs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. V. Ramana (1997) ArticleTitleAn Exact Duality Theory for Semidefinite Programming and Its Complexity Implications Mathematical Programming 77 129–162
M. V. Ramana L. Tuncel H. Wolkowicz (1997) ArticleTitleStrong Duality for Semidefinite Programming SIAM Journal on Optimization 7 644–662
H. Wolkowicz R. Saigal L. Vandenberghe (2000) Handbook of Semidefinite Programming, International Series in Operations Research and Management Science Kluwer Academic Publishers Dordrecht, Netherlands
V. Jeyakumar G. M. Lee N. Dinh (2003) ArticleTitleNew Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs SIAM Journal on Optimization 14 534–547
L. Thibault (1997) ArticleTitleSequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers SIAM Journal on Control and Optimization 35 1434–1444
J. M. Borwein (1980) ArticleTitleA Note on Perfect Duality and Limiting Lagrangians Mathematical Programming 18 330–337
J. M. Borwein H. Wolkowicz (1982) ArticleTitleCharacterizations of Optimality without Constraint Qualification for the Abstract Convex Program Mathematical Programing Study 19 77–100
J. M. Borwein H. Wolkowicz (1981) ArticleTitleCharacterizations of Optimality for the Abstract Convex Program with Finite-Dimensional Range Journal of the Australian Mathematical Society 30A 390–411
V. Jeyakumar H. Wolkowicz (1990) ArticleTitleZero Duality Gaps in Infinite-Dimensional Programming Journal of Optimization Theory and Applications 67 87–108
K. O. Kortanek Q. Zhang (2001) ArticleTitlePerfect Duality in Semi-Infinite and Semidefinite Programming Mathematical Programming 91A 127–144
R. T. Rockafellar (1974) Conjugate Duality and Optimization SIAM Philadelphia, Pennsylvania
V. Jeyakumar (2003) ArticleTitleCharacterizing Set Containments Involving Infinite Convex Constraints and Reverse Convex Constraints SIAM Journal on Optimization 13 947–959
Jeyakumar, V., Lee, G. M., and Dinh, N., Solution Sets of Convex Vector Minimization Problems, Applied Mathematics Research Report AMR02/15, University of New South Wales, Sydney, NSW, Australia, 2002; see also http://www.maths.unsw.edu.au/applied/reports/amr02.html.
J. B. Hiriart-urruty (1982) ε-Subdifferential J. P. Aubin R. Vinter (Eds) Convex Analysis and Optimization Pitman London, England 43–92
J. B. Hiriart-urruty C. Lemarechal (1993) Convex Analysis and Minimization Algorithms, Volumes I and II Springer Verlag Berlin, Germany
J. Gwinner (1987) ArticleTitleResults of Farkas Type Numerical Functional Analysis and Optimization 9 471–520
V. Jeyakumar A. Zaffaroni (1996) ArticleTitleAsymptotic Conditions for Weak and Proper Optimality in Infinite-Dimensional Convex Vector Optimization Numerical Functional Analysis and Optimization 17 323–343
V. Jeyakumar A. M. Rubinov B. M. Glover Y. Ishizuka (1996) ArticleTitleInequality Systems and Global Optimization Journal of Mathematical Analysis and Applications 202 900–919
V. Jeyakumar H. Wolkowicz (1992) ArticleTitleGeneralizations of Slater’s Constraint Qualification for Infinite Convex Programs Mathematical Programming 57 85–102
M. Hayashi H. Komiya (1982) ArticleTitlePerfect Duality for Convexlike Programs Journal of Optimization Theory and Applications 38 179–189
B. D. Craven (1978) Mathematical Programming and Control Theory Chapman and Hall London, UK
Author information
Authors and Affiliations
Additional information
The authors are grateful to the referee and Professor Franco Giannessi for valuable comments and constructive suggestions which have contributed to the final preparation of the paper.
Rights and permissions
About this article
Cite this article
Dinh, N., Jeyakumar, V. & Lee, G.M. Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming. J Optim Theory Appl 125, 85–112 (2005). https://doi.org/10.1007/s10957-004-1712-8
Issue Date:
DOI: https://doi.org/10.1007/s10957-004-1712-8