New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces

Nonlinear Analysis, Theory, Methods and Applications

Volumn 69, Issue 1, 2008, Pages 323-336

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

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

(Locally) Farkas Minkowski condition; Conjugate functions; Constraint qualifications; Fenchel Lagrange dual; Stable strong duality

Indexed keywords

CONJUGATE GRADIENT METHOD; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

CONJUGATE FUNCTIONS; CONSTRAINT QUALIFICATIONS; FARKAS-MINKOWSKI CONDITIONS; FENCHEL LAGRANGE DUALS; STABLE STRONG DUALITY;

OPTIMIZATION;

EID: 43049179419     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.na.2007.05.021     Document Type: Article

References (22)

1. 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
2. R.I. Boţ, S.M. Grad, G. Wanka, On strong and total Lagrange duality for convex optimization problems, Journal of Mathematical Analysis and Applications (in press)
3. Boţ R.I., and Wanka G. A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. Nonlinear Analysis: Theory, Methods & Applications 64 12 (2006) 2787-2804
4. Boţ R.I., and Wanka G. An alternative formulation for a new closed cone constraint qualification. Nonlinear Analysis: Theory, Methods & Applications 64 6 (2006) 1367-1381
5. Burachik R.S., and Jeyakumar V. A dual condition for the convex subdifferential sum formula with applications. Journal of Convex Analysis 12 2 (2005) 279-290
6. Combari C., Laghdir M., and Thibault L. Sous-différentiels de fonctions convexes composées. Annales des Sciences Mathématiques du Québec 18 2 (1994) 119-148
7. Dinh N., Goberna M.A., and López M.A. From linear to convex systems: consistency, Farkas' lemma and applications. Journal of Convex Analysis 13 1 (2006) 113-133
8. N. Dinh, M.A. Goberna, M.A. López, T.Q. Son, New Farkas-type constraint qualifications in convex infinite programming, ESAIM: Control, Optimisation and Calculus of Variations (in press)
9. Fajardo M.D., and López M.A. Locally Farkas-Minkowski systems in convex semi-infinite programming. Journal of Optimization Theory and Applications 103 2 (1999) 313-335
10. M.A. Goberna, V. Jeyakumar, M.A. López, Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities, Nonlinear Analysis: Theory, Methods & Applications, in press (doi:10.1016/j.na.2006.12.014)
11. Goberna M.A., López M.A., and Pastor J. Farkas-Minkowski systems in semi-infinite programming. Applied Mathematics and Optimization 7 (1981) 295-308
12. Hiriart-Urruty J.-B., and Lemaréchal C. Convex Analysis and Minimization Algorithms I: Fundamentals (1993), Springer-Verlag, Berlin
13. Hu H. Characterizations of the strong basic constraint qualifications. Mathematics of Operations Research 30 4 (2005) 956-965
14. 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
15. 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
16. Li C., and Ng K.F. On constraint qualification for an infinite system of convex inequalities in a Banach space. SIAM Journal on Optimization 15 2 (2005) 488-512
17. Li W., Nahak C., and Singer I. Constraint qualifications for semi-infinite systems of convex inequalities. SIAM Journal on Optimization 11 1 (2000) 31-52
18. Luc D.T. Theory of Vector Optimization (1989), Springer-Verlag, Berlin
19. Penot J.P., and Théra M. Semi-continuous mappings in general topology. Archiv der Mathematik 38 (1982) 158-166
20. Simons S. The Hahn-Banach-Lagrange theorem. Optimization 56 1-2 (2007) 149-169
21. Tiba D., and Zǎlinescu C. On the necessity of some constraint qualification conditions in convex programming. Journal of Convex Analysis 11 1 (2004) 95-110
22. Zǎlinescu C. Convex Analysis in General Vector Spaces (2002), World Scientific, River Edge