On strong and total Lagrange duality for convex optimization problems

Journal of Mathematical Analysis and Applications

Volumn 337, Issue 2, 2008, Pages 1315-1325

  Boţ, Radu Ioan ^a   Grad, Sorin Mihai ^a   Wanka, Gert ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

(Locally) Farkas Minkowski condition; Basic constraint qualification; Conjugate functions; Lagrange dual problem; Stable strong duality

Indexed keywords

EID: 34548654625     PISSN: 0022247X     EISSN: 10960813     Source Type: Journal    
DOI: 10.1016/j.jmaa.2007.04.071     Document Type: Article

References (22)

1. Aït Mansour M., Metrane A., and Théra M. Lower semicontinuous regularization for vector-valued mappings. J. Global Optim. 35 2 (2006) 283-309
2. R.I. Boţ, S.M. Grad, G. Wanka, A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces, Math. Nachr., in press
3. R.I. Boţ, S.M. Grad, G. Wanka, New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces, Preprint 13/2006, Fakultät für Mathematik, Technische Universität Chemnitz, 2006
4. Boţ R.I., and Wanka G. A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. Nonlinear Anal. 64 12 (2006) 2787-2804
5. Boţ R.I., and Wanka G. An alternative formulation for a new closed cone constraint qualification. Nonlinear Anal. 64 6 (2006) 1367-1381
6. Burachik R.S., and Jeyakumar V. A dual condition for the convex subdifferential sum formula with applications. J. Convex Anal. 12 2 (2005) 279-290
7. Combari C., Laghdir M., and Thibault L. Sous-différentiels de fonctions convexes composées. Ann. Sci. Math. Québec 18 2 (1994) 119-148
8. Dinh N., Goberna M.A., and López M.A. From linear to convex systems: Consistency, Farkas' lemma and applications. J. Convex Anal. 13 1 (2006) 113-133
9. N. Dinh, M.A. Goberna, M.A. López, T.Q. Son, New Farkas-type constraint qualifications in convex infinite programming, ESAIM Control Optim. Calc. Var., in press
10. Fajardo M.D., and López M.A. Locally Farkas-Minkowski systems in convex semi-infinite programming. J. Optim. Theory Appl. 103 2 (1999) 313-335
11. M.A. Goberna, V. Jeyakumar, M.A. López, Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities, Nonlinear Anal., in press. DOI: 10.1016/j.na.2006.12.014
12. Goberna M.A., López M.A., and Pastor J. Farkas-Minkowski systems in semi-infinite programming. Appl. Math. Optim. 7 (1981) 295-308
13. Hiriart-Urruty J.-B., and Lemaréchal C. Convex Analysis and Minimization Algorithms I: Fundamentals (1993), Springer-Verlag, Berlin
14. Hu H. Characterizations of the strong basic constraint qualifications. Math. Oper. Res. 30 4 (2005) 956-965
15. V. Jeyakumar, N. Dinh, G.M. Lee, A new closed cone constraint qualification for convex optimization, Applied Mathematics Report AMR 04/8, University of New South Wales, 2004
16. V. Jeyakumar, W. Song, N. Dinh, G.M. Lee, Stable strong duality in convex optimization, Applied Mathematics Report AMR 05/22, University of New South Wales, 2005
17. Li C., and Ng K.F. On constraint qualification for an infinite system of convex inequalities in a Banach space. SIAM J. Optim. 15 2 (2005) 488-512
18. Li W., Nahak C., and Singer I. Constraint qualifications for semi-infinite systems of convex inequalities. SIAM J. Optim. 11 1 (2000) 31-52
19. Luc D.T. Theory of Vector Optimization (1989), Springer-Verlag, Berlin
20. Penot J.P., and Théra M. Semi-continuous mappings in general topology. Arch. Math. 38 (1982) 158-166
21. Tiba D., and Zǎlinescu C. On the necessity of some constraint qualification conditions in convex programming. J. Convex Anal. 11 1 (2004) 95-110
22. Zǎlinescu C. Convex Analysis in General Vector Spaces (2002), World Scientific, River Edge