Constraint qualifications characterizing lagrangian duality in convex optimization

Journal of Optimization Theory and Applications

Volumn 136, Issue 1, 2008, Pages 31-41

  Jeyakumar, V ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Constraint qualifications; Convex programming; Lagrangian duality; Necessary and sufficient conditions

Indexed keywords

LAGRANGE MULTIPLIERS;

CONDITION; CONSTRAINT QUALIFICATION; CONVEX OPTIMISATION; DUALITY THEORY; LAGRANGIAN DUALITY; NECESSARY AND SUFFICIENT CONDITION;

CONVEX OPTIMIZATION;

EID: 38049050343     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-007-9294-x     Document Type: Article

References (17)

1. Craven, B.D.: Mathematical Programming and Control Theory. Chapman and Hall, London (1978)
2. Borwein, J.M., Lewis, A.S.: Partially finite convex programming, Part I: Quasi-relative interiors and duality. Math. Program. 57, 15-48 (1992)
3. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
4. Jeyakumar, V., Wolkowicz, H.: Generalizations of Slater's constraint qualification for infinite convex programs. Math. Program. 57, 85-102 (1992)
5. Ramana, M.V., Tunçel, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7, 644-662 (1997)
6. Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)
7. Jeyakumar, V.: The strong conical hull intersection property for convex programming. Math. Program. 106A, 81-92 (2006)
8. Hiriart-Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)
9. Jeyakumar, V.: A note on strong duality in convex semidefinite optimization: Necessary and sufficient conditions. Optim. Lett. 2, 15-25 (2008)
10. Bauschke, H.H., Borwein, J.M., Li, W.: Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization. Math. Program. 86, 135-160 (1999)
11. Burachik, R.S., Jeyakumar, V.: A simple closure condition for the normal cone intersection formula. Proc. Am. Math. Soc. 133(6), 1741-1748 (2004)
12. Jeyakumar, V., Mohebi, H.: Limiting ε-subgradient characterizations of constrained best approximation. J. Approx. Theory 135, 145-159 (2005)
13. Jeyakumar, V., Nealon, M.: Complete dual characterizations of optimality for convex semidefinite programming. Canadian Math. Soc. Conf. Proc. 27, 165-173 (2000)
14. Burachik, R.S., Jeyakumar, V.: A dual conditions for the convex subdifferential sum formula with applications. J. Convex Anal. 12(2), 229-233 (2005)
15. Jeyakumar, V., Rubinov, A.M., Glover, B.M., Ishizuka, Y.: Inequality systems and global optimization. J. Math. Anal. Appl. 202, 900-919 (1996)
16. Bot, R.I., Wanka, G.: An alternative formulation for a new closed cone constraint qualification. Nonlinear Anal. 64, 1367-1381 (2006)
17. Jeyakumar, V., Lee, G.M., Dinh, N.: A closed cone constraint qualification for convex optimization. Applied Mathematics Research Report AMR04/8, University of New South Wales, Sydney, Australia (2004)