Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization

The celebrated S-lemma establishes a powerful equivalent condition for the nonnegativity of a quadratic function over a single quadratic inequality. However, this lemma fails without the technical condition, known as the Slater condition. In this paper, we first show that the Slater condition is indeed necessary for the S-lemma and then establishes a regularized form of the S-lemma in the absence of the Slater condition. Consequently, we present characterizations of global optimality and the Lagrangian duality for quadratic optimization problems with a single quadratic constraint. Our method of proof makes use of Brickman’s theorem and conjugate analysis, exploiting the hidden link between the convexity and the S-lemma.

[1]  Zhi-You Wu,et al.  Liberating the Subgradient Optimality Conditions from Constraint Qualifications , 2006, J. Glob. Optim..

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

[3]  Vaithilingam Jeyakumar,et al.  New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs , 2003, SIAM J. Optim..

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

[5]  Boris Polyak.  Convexity of Quadratic Transformations and Its Use in Control and Optimization , 1998 .

[6]  Mustafa Ç. Pinar,et al.  On the S-procedure and Some Variants , 2006, Math. Methods Oper. Res..

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

[8]  Tamás Terlaky,et al.  A Survey of the S-Lemma , 2007, SIAM Rev..

[9]  Shuzhong Zhang,et al.  On Cones of Nonnegative Quadratic Functions , 2003, Math. Oper. Res..

[10]  Vaithilingam Jeyakumar,et al.  Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming , 2005 .

[11]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[12]  V. Jeyakumar,et al.  Farkas Lemma: Generalizations , 2009, Encyclopedia of Optimization.

[13]  L. Brickman.  ON THE FIELD OF VALUES OF A MATRIX , 1961 .

[14]  Miguel A. Goberna,et al.  From linear to convex systems: consistency, Farkas' Lemma and applications , 2006 .

[15]  V. Jeyakumar.  The strong conical hull intersection property for convex programming , 2006, Math. Program..

[16]  Zhi-You Wu,et al.  Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions , 2007, Math. Program..

[17]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

[18]  Vaithilingam Jeyakumar,et al.  Nonlinear Extensions of Farkas' Lemma with Applications to Global Optimization and Least Squares , 1995, Math. Oper. Res..

[19]  Vaithilingam Jeyakumar,et al.  Inequality systems and global optimization , 1996 .

[20]  Zhi-Quan Luo,et al.  Multivariate Nonnegative Quadratic Mappings , 2003, SIAM J. Optim..

[21]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[22]  L. L. Dines.  On the mapping of quadratic forms , 1941 .