Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements

Optimization

Volumn 61, Issue 1, 2012, Pages 35-65

  Boţ, Radu Ioan ^a   Csetnek, Ernö Robert ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

convex optimization; Fenchel duality; Lagrange duality; perturbation theory; quasi interior; quasi relative interior

Indexed keywords

EID: 84856817068     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331934.2010.505649     Document Type: Article

References (47)

1. Aït Mansour, M, Metrane, A and Théra, M. 2006. Lower semicontinuous regularization for vector-valued mappings. J. Global Optim., 35: 283-309.
2. Ban, LQ and Song, W. 2009. Duality gap of the conic convex constrained optimization problems in normed spaces. Math. Program., 119: 195-214.
3. Bertsekas, DP. 2008. Extended monotropic programming and duality. J. Optim. Theor. Appl., 139: 209-225.
4. Borwein, JM and Goebel, R. 2003. Notions of relative interior in Banach spaces. J. Math. Sciences, 115: 2542-2553.
5. Borwein, JM, Jeyakumar, V, Lewis, AS and Wolkowicz, H. 1988. Constrained approximation via convex programming, University of Waterloo. Preprint
6. Borwein, JM and Lewis, AS. 1992. Partially finite convex programming, part I: Quasi relative interiors and duality theory. Math. Program., 57: 15-48.
7. Borwein, JM, Lucet, Y and Mordukhovich, B. 2000. Compactly epi-Lipschitzian convex sets and functions in normed spaces. J. Convex Anal., 7: 375-393.
8. Boţ, RI. 2010. "Conjugate Duality in Convex Optimization". In Lecture Notes in Economics and Mathematical Systems, Vol. 637, Berlin, Heidelberg: Springer-Verlag.
9. Boţ RI, Csetnek, ER and Moldovan, A. 2008. Revisiting some duality theorems via the quasirelative interior in convex optimization. J. Optim. Theor. Appl., 139: 67-84.
10. Boţ, RI, Csetnek, ER and Wanka, G. 2008. Regularity conditions via quasi-relative interior in convex programming. SIAM J. Optim., 19: 217-233.
11. Boţ, RI, Grad, S-M and Wanka, G. 2008. On strong and total Lagrange duality for convex optimization problems. J. Math. Anal. Appl., 337: 1315-1325.
12. Boţ, RI and Wanka, G. 2006. An alternative formulation for a new closed cone constraint qualification. Nonlinear Anal.: Theor., Meth. Appl., 64: 1367-1381.
13. Boţ, RI and Wanka, G. 2006. A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. Nonlinear Anal.: Theor., Meth. Appl., 64: 2787-2804.
14. Burachik, RS and Jeyakumar, V. 2005. A new geometric condition for Fenchel's duality in infinite dimensional spaces. Math. Program., 104: 229-233.
15. Burachik, RS, Jeyakumar, V and Wu, Z-Y. 2006. Necessary and sufficient conditions for stable conjugate duality. Nonlinear Anal.: Theor., Meth. Appl., 64: 1998-2006.
16. Cammaroto, F and Di Bella, B. 2005. Separation theorem based on the quasirelative interior and application to duality theory. J. Optim. Theor. Appl., 125: 223-229.
17. Cammaroto, F and Di Bella, B. 2007. On a separation theorem involving the quasi-relative interior. Proc. Edin. Math. Soc. (2), 50: 605-610.
18. Combari, C, Laghdir, M and Thibault, L. 1994. Sous-différentiels de fonctions convexes composées. Annales des Sciences Mathématiques du Québec, 18: 119-148.
19. E.R. Csetnek, Overcoming the Failure of the Classical Generalized Interior-point Regularity Conditions in Convex Optimization. Applications of the Duality Theory to Enlargements of Maximal Monotone Operators, Logos Verlag, Berlin, 2010.
20. Daniele, P and Giuffrè, S. 2007. General infinite dimensional duality and applications to evolutionary network equilibrium problems. Optim. Lett., 1: 227-243.
21. Daniele, P, Giuffrè, S, Idone, G and Maugeri, A. 2007. Infinite dimensional duality and applications. Math. Ann., 339: 221-239.
22. Ekeland, I and Temam, R. 1976. Convex Analysis and Variational Problems, Amsterdam: North-Holland Publishing Company.
23. Fang, DH, Li, C and Ng, KF. 2009. Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim., 20: 1311-1332.
24. Giannessi, F. 2005. "Constrained optimization and image space analysis, volume 1: separation of sets and optimality conditions". In in Mathematical Concepts and Methods in Science and Engineering, Vol. 49, New York: Springer.
25. Gowda, MS and Teboulle, M. 1990. A comparison of constraint qualifications in infinite-dimensional convex programming. SIAM J. Cont. Optim., 28: 925-935.
26. Holmes, RB. 1975. Geometric Functional Analysis and its Applications, Berlin: Springer-Verlag.
27. Jeyakumar, V, Dinh, N and Lee, GM. 2004. "A new closed cone constraint qualification for convex optimization". In Appl. Math. Rep. AMR 04/8, Sydney, Australia: University of New South Wales.
28. Jeyakumar, V, Huy, NQ and Li, G. 2009. Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization. Optim. Eng., 10: 491-503.
29. Jeyakumar, V and Lee, GM. 2008. Complete characterizations of stable Farkas' lemma and cone-convex programming duality. Math. Program., 114: 335-347.
30. Jeyakumar, V and Li, G. 2009. New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs. Nonlinear Anal., 72: e2239-e2249.
31. Jeyakumar, V and Li, G. 2009. Stable zero duality gaps in convex programming: Complete dual characterizations with applications to semidefinite programs. J. Math. Anal. Appl., 360: 156-167.
32. Jeyakumar, V and Wolkowicz, H. 1992. Generalizations of Slater's constraint qualification for infinite convex programs. Math. Program. Series B, 57: 85-101.
33. Li, C, Fang, D, López, G and López, MA. 2009. Stable and total Fenchel duality for convex optimization problems in locally convex spaces. SIAM J. Optim., 20: 1032-1051.
34. Li, G and Jeyakumar, V. 2009. Qualification-free optimality conditions for convex programs with separable inequality constraints. J. Convex Anal., 16: 845-856.
35. Li, G and Ng, KF. 2008. On extension of Fenchel duality and its application. SIAM J. Optim., 19: 1489-1509.
36. p spectral estimation with lattice bounds. J. Optim. Theor. Appl., 78: 143-161.
37. Luc, DT. 1989. Theory of Vector Optimization, Berlin: Springer-Verlag.
38. Magnanti, TL. 1974. Fenchel and Lagrange duality are equivalent. Math. Program., 7: 253-258.
39. Penot, J-P and Théra, M. 1982. Semi-continuous mappings in general topology. Archiv der Mathematik, 38: 158-166.
40. R.T. Rockafellar, Conjugate Duality and Optimization, Conference Board of the Mathematical Sciences Regional Conference Series in Applied Mathematics 16, Society for Industrial and Applied Mathematics, Philadelphia, 1974.
41. Rodrigues, B. 1990. The Fenchel duality theorem in Fréchet spaces. Optimization, 21: 13-22.
42. Simons, S. 2008. From Hahn-Banach to Monotonicity, Berlin: Springer-Verlag.
43. Tanaka, T. 1997. Generalized semicontinuity and existence theorems for cone saddle points. Appl. Math. Optimmization, 36: 313-322.
44. Tanaka, T and Kuroiwa, D. 1993. The convexity of A and B assures intA + B = int(A + B). Appl. Math. Lett., 6: 83-86.
45. Tseng, P. 2009. Some convex programs without a duality gap. Math. Program., 116: 553-578.
46. Zǎlinescu, C. 1999. A comparison of constraint qualifications in infinite-dimensional convex programming revisited. J. Australian Math. Soc. Series B, 40: 353-378.
47. Zǎlinescu, C. 2002. Convex Analysis in General Vector Spaces, Singapore: World Scientific.