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

For the existence of strong duality in convex optimization regularity conditions play an indisputable role. In this article we mainly deal with regularity conditions formulated by means of different generalizations of the notion of interior of a set. The primal–dual pair we investigate is a general one expressed in the language of a perturbation function and by employing its Fenchel–Moreau conjugate. After providing an overview on the generalized interior-point conditions that exist in the literature we introduce several new ones formulated by means of the quasi-interior and quasi-relative interior. We underline the advantages of the new conditions vis-á-vis the classical ones and illustrate our investigations by numerous examples. We conclude this article by particularizing the general approach to the classical Fenchel and Lagrange duality concepts.

[1]  Ernö Robert Csetnek,et al.  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 , 2010 .

[2]  R. Boţ,et al.  Conjugate Duality in Convex Optimization , 2010 .

[3]  Guoyin Li,et al.  New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs , 2009 .

[4]  Vaithilingam Jeyakumar,et al.  Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs , 2009 .

[5]  Kung Fu Ng,et al.  Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming , 2009, SIAM J. Optim..

[6]  Chong Li,et al.  Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces , 2009, SIAM J. Optim..

[7]  Wen Song,et al.  Duality gap of the conic convex constrained optimization problems in normed spaces , 2009, Math. Program..

[8]  Dwight R Stoll,et al.  Equation for peak capacity estimation in two-dimensional liquid chromatography. , 2009, Analytical chemistry.

[9]  Paul Tseng.  Some convex programs without a duality gap , 2009, Math. Program..

[10]  V. Jeyakumar,et al.  Qualification-Free Optimality Conditions for Convex Programs with Separable Inequality Constraints∗ , 2009 .

[11]  N. Q. Huy,et al.  Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization , 2009 .

[12]  Liu Guoyin,et al.  On Extension of Fenchel Duality and its Application , 2008 .

[13]  Ernö Robert Csetnek,et al.  Revisiting Some Duality Theorems via the Quasirelative Interior in Convex Optimization , 2008 .

[14]  D. Bertsekas.  Extended Monotropic Programming and Duality , 2008 .

[15]  Vaithilingam Jeyakumar,et al.  Complete characterizations of stable Farkas’ lemma and cone-convex programming duality , 2008, Math. Program..

[16]  Radu Ioan Bot,et al.  Regularity Conditions via Quasi-Relative Interior in Convex Programming , 2008, SIAM J. Optim..

[17]  Chong Li,et al.  Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization , 2008, SIAM J. Optim..

[18]  Sorin-Mihai Grad,et al.  On strong and total Lagrange duality for convex optimization problems , 2008 .

[19]  S. Simons.  From Hahn-Banach to monotonicity , 2008 .

[20]  Guoyin Li,et al.  On Extension of Fenchel Duality and its Application , 2008, SIAM J. Optim..

[21]  F. Cammaroto,et al.  ON A SEPARATION THEOREM INVOLVING THE QUASI-RELATIVE INTERIOR , 2007, Proceedings of the Edinburgh Mathematical Society.

[22]  Antonino Maugeri,et al.  Infinite dimensional duality and applications , 2007 .

[23]  Patrizia Daniele,et al.  General infinite dimensional duality and applications to evolutionary network equilibrium problems , 2007, Optim. Lett..

[24]  Gert Wanka,et al.  A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces , 2006 .

[25]  Michel Théra,et al.  Lower Semicontinuous Regularization for Vector-Valued Mappings , 2006, J. Glob. Optim..

[26]  Vaithilingam Jeyakumar,et al.  Necessary and sufficient conditions for stable conjugate duality , 2006 .

[27]  Gert Wanka,et al.  An alternative formulation for a new closed cone constraint qualification , 2006 .

[28]  Regina Sandra Burachik,et al.  A new geometric condition for Fenchel's duality in infinite dimensional spaces , 2005, Math. Program..

[29]  F. Cammaroto,et al.  Separation Theorem Based on the Quasirelative Interior and Application to Duality Theory , 2005 .

[30]  Franco Giannessi,et al.  Separation of sets and optimality conditions , 2005 .

[31]  Jonathan M. Borwein,et al.  Notions of Relative Interior in Banach Spaces , 2003 .

[32]  C. Tammer,et al.  Theory of Vector Optimization , 2003 .

[33]  C. Zălinescu.  Convex analysis in general vector spaces , 2002 .

[34]  Boris S. Mordukhovich,et al.  Compactly epi-Lipschitzian convex sets and functions in normed spaces , 2000 .

[35]  C. Zălinescu,et al.  A comparison of constraint qualifications in infinite-dimensional convex programming revisited , 1999, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[36]  Tamaki Tanaka,et al.  Generalized Semicontinuity and Existence Theorems for Cone Saddle Points , 1997 .

[37]  C. Combari,et al.  Sous-différentiels de fonctions convexes composées , 1994 .

[38]  Robert K. Goodrich,et al.  Quasi interiors, lagrange multipliers, andLp spectral estimation with lattice bounds , 1993 .

[39]  Daishi Kuroiwa,et al.  The convexity of A and B assures intA+B=int(A+B) , 1993 .

[40]  Henry Wolkowicz,et al.  Generalizations of Slater's constraint qualification for infinite convex programs , 1992, Math. Program..

[41]  Jonathan M. Borwein,et al.  Partially finite convex programming, Part I: Quasi relative interiors and duality theory , 1992, Math. Program..

[42]  Marc Teboulle,et al.  A comparison of constraint quali cations in in nite-dimensional convex programming , 1990 .

[43]  Brian Rodrigues.  The Fenchel duality theorem in Fréchet spaees , 1990 .

[44]  J. Penot,et al.  Semi-continuous mappings in general topology , 1982 .

[45]  I. Ekeland,et al.  Convex analysis and variational problems , 1976 .

[46]  R. Holmes.  Geometric Functional Analysis and Its Applications , 1975 .

[47]  Thomas L. Magnanti,et al.  Fenchel and Lagrange duality are equivalent , 1974, Math. Program..

[48]  R. Tyrrell Rockafellar.  Conjugate Duality and Optimization , 1974 .