Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Tal A, Nemirovski A (2000) Lectures on modern convex optimization: analysis, algorithms and engineering applications. SIAM, Philadelphia
Boyd S, El-Ghaoul L, Feron E, Balakhrishnan V (1994) Linear matrix inequalities in systems and control theory. SIAM, Philadelphia
Brickman L (1961) On the field of values of a matrix. Proc Am Math Soc 12:61–66
Burachik RS, Jeyakumar V (2005) A new geometric condition for Fenchel duality in infinite dimensions. Math Program Ser B 104:229–233
Derinkuyu K, Pinar MC (2006) On the S-procedure and some variants. Math Methods Oper Res 64:55–77
Dinh N, Jeyakumar V, Lee GM (2005) Sequential Lagrangian conditions for convex programs with applications to semidefinite programming. J Optim Theory Appl 125:85–112
Dinh N, Goberna MA, López MA (2006) From linear to convex systems: Consistency Farkas’ Lemma and application. J Convex Anal 13:1–21
Jeyakumar V (2001) Farkas Lemma: generalizations. In: Encyclopedia of optimization, vol 2. Kluwer Academic, Dordrecht, pp 87–91
Jeyakumar V (2006) The strong conical hull intersection property for convex programming. Math Program Ser A 106:81–92
Jeyakumar V, Glover BM (1995) Nonlinear extensions of Farkas lemma with applications to global optimization and least squares. Math Oper Res 20:818–837
Jeyakumar V, Lee GM (2008) Complete characterizations of stable Farkas lemma and cone-convex programming duality. Math Program Ser A 114:335–347
Jeyakumar V, Lee GM, Dinh N (2003) New sequential Lagrange multiplier conditions characterizing optimality without constraint qualifications. SIAM J Optim 14(2):534–547
Jeyakumar V, Wu ZY, Lee GM, Dinh N (2006) Liberating the subgradient optimality conditions from constraint qualifications. J Glob Optim 36:127–137
Jeyakumar V, Rubinov AM, Wu ZY (2007) Nonconvex quadratic minimization with quadratic constraints: Global optimality conditions. Math Program Ser A 110:521–541
Luo Z-Q, Sturm J, Zhang SZ (2004) Multivariate nonnegative quadratic mappings. SIAM J Optim 14:1140–1162
Martínez-Legaz JE (2005) On Brickman’s theorem. J Convex Anal 12:139–143
Polik I, Terlaky T (2007) A survey of S-lemma. SIAM Rev 49:371–418
Polyak BT (1998) Convexity of quadratic transformations and its us in control and optimization. J Optim Theory Appl 99:553–583
Sturm JF, Zhang SZ (2003) On cones of nonnegative quadratic functions. Math Oper Res 28:246–267
Yakubovich VA (1977) The S-procedure in nonlinear control theory. Vestn Leningr Univ 4:73–93
Zalinescu C (2002) Convex analysis in general vector space. World Scientific, Singapore
Author information
Authors and Affiliations
Corresponding author
Additional information
Authors are grateful to the referee for his comments and suggestions which have contributed to the final preparation of the paper. This research was partially supported by the Australian Research Council.
Rights and permissions
About this article
Cite this article
Jeyakumar, V., Huy, N.Q. & Li, G. Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization. Optim Eng 10, 491–503 (2009). https://doi.org/10.1007/s11081-008-9076-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11081-008-9076-9