Constraint qualifications for extended Farkas's Lemmas and Lagrangian dualities in convex infinite programming

SIAM Journal on Optimization

Volumn 20, Issue 3, 2009, Pages 1311-1332

  Fang, D H ^a,b   Li, C ^b   Ng, K F ^c  

^a JISHOU UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Conic programming; Convex inequality system; Farkas lemma; Strong lagrangian duality

Indexed keywords

CONIC PROGRAMMING; CONSTRAINED MINIMIZATION PROBLEM; CONSTRAINED SYSTEMS; CONSTRAINT QUALIFICATION; FARKAS LEMMA; INEQUALITY SYSTEMS; LAGRANGIAN DUALITY; SEMI-CONTINUOUS; SUFFICIENT CONDITIONS;

LAGRANGE MULTIPLIERS;

EID: 73249145584     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/080739124     Document Type: Article

References (52)

1. M. AÏT MANSOOUR, A. METRANE, AND M. THÉRA, Lower semicontinuous regularization for vector-valued mappings, J. Global Optim., 35 (2006), pp. 283-309.
2. V. BARBU AND T. PRECUPANU, Convexity and Optimization in Banach Spaces, Sijthoff & Noordhoff, Alphen aan den Rijn, The Netherlands, 1978.
3. R. I. BOŢ, E. R. CSETNEK, AND G. WANKA, Regularity conditions via quasi-relative interior in convex programming, SIAM J. Optim., 19 (2008), pp. 217-233.
4. R. I. BOŢ, S. M. GRAD, AND G. WANKA, A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces, Math. Nachr., 281 (2008), pp. 1088-1107.
5. R. I. BOŢ, S. M. GRAD, AND G. WANKA, On strong and total Lagrange duality for convex optimization problems, J. Math. Anal. Appl., 337 (2008), pp. 1315-1325.
6. R. I. BO̧Ţ, S. M. GRAD, AND G. WANKA, New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces, Nonlinear Anal., 69 (2008), pp. 323-336.
7. R. I. BOŢ, I. B. HODREA, AND G. WANKA, Some new Farkas-type results for inequality systems with DC functions, J. Global Optim., 39 (2007), pp. 595-608.
8. R. I. BO̧T AND G. WANKA, Farkas-type results with conjugate functions, SIAM J. Optim., 15 (2005), pp. 540-554.
9. R. I. BOŢ AND G. WANKA, An alternative formulation for a new closed cone constraint qualification, Nonlinear Anal., 64 (2006), pp. 1367-1381.
10. R. I. BOŢ AND G. WANKA, A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces, Nonlinear Anal., 64 (2006), pp. 2787-2804.
11. R. S. BURACHIK AND V. JEYAKUMAR, A simple closure condition for the normal cone intersection formula, Proc. Amer. Math. Soc, 133 (2005), pp. 1741-1748.
12. R. S. BURACHIK AND V. JEYAKUMAR, A new geometric condition for Fenchel's duality in infinite dimensional spaces, Math. Program. Ser. B, 104 (2005), pp. 229-233.
13. R. S. BURACHIK AND V. JEYAKUMAR, A dual condition for the convex subdifferential sum formula with applications, J. Convex Anal., 12 (2005), pp. 279-290.
14. J. V. BURKE AND M. C. FERRIS, A Gauss-Newton method for convex composite optimization, Math. Program., 71 (1995), pp. 179-194.
15. C. COMBARI, M. LAGHDIR, AND L. THIBAULT, Sous-différentiels de foncitions convexes composées, Ann. Sci. Math. Québec, 18 (1994), pp. 119-148.
16. N. DINH, M. A. GOBERNA, AND M. A. LÓ PEZ, From linear to convex systems: Consistency, Farkas lemma and applications, J. Convex Anal., 13 (2006), pp. 279-290.
17. N. DINH, M. A. GOBERNA, M. A. LÓPEZ, AND T. Q. SON, New Farkas-type constraint qualifications in convex infinite programming, ESAIM Control Optim. Calc. Var., 13 (2007), pp. 580-597.
18. N. DINH, V. JEYAKUMAR, AND G. M. LEE, Sequential Lagrangian conditions for convex programs with applications to semidefinite programming, J. Optim. Theory Appl., 125 (2005), pp. 85-112.
19. N. DINH, B. MORDUKHOVICH, AND T. T. A. NGHIA, Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs, Math. Program., to appear.
20. N. DINH, B. MORDUKHOVICH, AND T. T. A. NGHIA, Qualification and optimality conditions for convex and DC programs with infinite constraints, Acta Math. Vietnam., to appear.
21. N. DINH, T. T. A. NGHIA, AND G. VALLET, A closedness condition and its applications to DC programs with convex constraints, Optimization, to appear.
22. N. DINH, G. VALLET, AND T. T. A. NGHIA, Farkas-type results and duality for DC programs with convex constraints, J. Convex Anal., 15 (2008), pp. 235-262.
23. M. A. GOBERNA, V. JEYAKUMAR, AND M. A. LÓPEZ, Necessary and sufficient conditions for solvability of systems of infinite convex inequalities, Nonlinear Anal., 68 (2008), pp. 1184-1194.
24. M. A. GOBERNA AND M. A. LÓPEZ, Linear Semi-infinite Optimization, John Wiley, Chichester, 1998.
25. A. HANTOUTE, M. A. LÓPEZ, AND C. ZǍLINESCU, Subdifferential calculus rules in convex analysis: A unifying approach via pointwise supremum functions, SIAM J. Optim., 19 (2008), pp. 863-882.
26. V. JEYAKUMAR, Farkas lemma: Generalizations, in Encyclopedia of Optimization II, C. A. Floudas and P. Pardalos, eds., Kluwer, Dordrecht, 2001, pp. 87-91.
27. V. JEYAKUMAR, Characterizing set containments involving infinite convex constraints and reverse-convex constraints, SIAM J. Optim., 13 (2003), pp. 947-959.
28. V. JEYAKUMAR, The strong conical hull intersection property for convex programming, Math. Program. Ser. A, 106 (2006), pp. 81-92.
29. V. JEYAKUMAR, Constraint qualifications characterizing Lagrangian duality in convex optimization, J. Optim. Theory Appl., 136 (2008), pp. 31-41.
30. V. JEYAKUMAR, G. M. LEE, and N. DINH, New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs, SIAM J. Optim., 14 (2003), pp. 534-547.
31. V. JEYAKUMAR AND G. M. LEE, Complete characterization of stable Farkas' lemma and coneconvex programming duality, Math. Program. Ser. A, 114 (2008), pp. 335-347.
32. V. JEYAKUMAR, G. M. LEE, and N. DINH, Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs, J. Optim. Theory Appl., 123 (2004), pp. 83-103.
33. V. JEYAKUMAR AND H. MOHEBI, Limiting ∈-subgradient characterizations of constrained best approximation, J. Approx. Theory, 135 (2005), pp. 145-159.
34. C. LI, On best uniform restricted range approximation in complex-valued continuous function spaces, J. Approx. Theory, 120 (2003), pp. 71-84.
35. C. LI and K. F. NG, Constraint qualification, the strong CHIP, and best approximation with convex constraints in Banach spaces, SIAM J. Optim., 14 (2003), pp. 584-607.
36. C. LI AND K. F. NG, On constraint qualification for an infinite system of convex inequalities in a Banach space, SIAM J. Optim., 15 (2005), pp. 488-512.
37. C. LI AND K. F. NG, On best restricted range approximation in continuous complex-valued function spaces, J Approx. Theory, 136 (2005), pp. 159-181.
38. C. LI AND K. F. NG, Strong CHIP for infinite system of closed convex sets in normed linear spaces, SIAM J. Optim., 16 (2005), pp. 311-340.
39. C. LI AND K. F. NG, Majorizing functions and convergence of the Gauss-Newton method for convex composite optimization, SIAM J. Optim., 18 (2007), pp. 613-642.
40. C. LI, K. F. NG, and T. K. PONG, The SECQ, linear regularity, and the strong CHIP for an infinite system of closed convex sets in normed linear spaces, SIAM J. Optim., 18 (2007), pp. 643-665.
41. C. LI, K. F. NG, and T. K. PONG, Constraint qualifications for convex inequality systems with applications in constrained optimization, SIAM J. Optim., 19 (2008), pp. 163-187.
42. W. LI, C. NAHAK, AND I. SINGER, Constraint qualifications for semi-infinite systems of convex inequalities, SIAM J. Optim., 11 (2000), pp. 31-52.
43. D. T. LUC, Theorey of Vector Optimization, Springer, Berlin, 1989.
44. J. P. PENOT AND M. THÉRA, Semi-continuous mappings in general topology, Arch. Math. (Basel), 38 (1982), pp. 158-166.
45. R. T. ROCKAFELLAR, Extension of Fenchel's duality theorem for convex functions, Duke Math. J., 33 (1966), pp. 81-89.
46. R. T. ROCKAFELLAR, First and second-order epidifferentiability in nonlinear programming, Trans. Amer. Math. Soc., 307 (1988), pp. 75-108.
47. R. T. ROCKAFELLAR AND R. J. B. WETS, Variational Analysis, Springer, Heidelberg, 1998.
48. G. S. SMIRNOV AND R. G. SMIRNOV, Best uniform restricted range approximation of complexvalued functions, C. R. Math. Acad. Sci. Canada, 19 (1997), pp. 58-63.
49. G. S. SMIRNOV AND R. G. SMIRNOV, Best uniform approximation of complex-valued functions by generalized polynomials having restricted range, J. Approx. Theory, 100 (1999), pp. 284-303.
50. T. STRÄBERG, The operation of infimal convolution, Dissertationes Math. (Rozprawy Mat.), 352 (1996), pp. 1-58.
51. C. ZǍLINESCU, Convex Analysis in General Vector Spaces, World Scientific, River Edge, NJ, 2002.
52. X. Y. ZHENG AND K. F. NG, Strong KKT conditions and weak sharp solutions in convex composite optimization, Math. Program., to appear.