A survey of the S-lemma

SIAM Review

Volumn 49, Issue 3, 2007, Pages 371-418

  Pólik, Imre ^a   Terlaky, Tamás ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Control theory; Generalized convexities; Nonconvex theorem of alternatives; Numerical range; Relaxation theory; S lemma; S procedure; Semidefinite optimization

Indexed keywords

COMPUTATIONAL GEOMETRY; LINEAR ALGEBRA; NUMERICAL ANALYSIS; OPTIMIZATION; THEOREM PROVING;

CONVEX GEOMETRY; GENERALIZED CONVEXITIES; NONCONVEX THEOREM OF ALTERNATIVES; RELAXATION THEORY; S-LEMMA; SEMIDEFINITE OPTIMIZATION;

CONTROL THEORY;

EID: 34548491396     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S003614450444614X     Document Type: Review

References (82)

1. M. A. AIZERMAN AND F. R. GANTMACHER, Absolute Stability of Regulator Systems, Holden-Day Series in Information Systems, Holden-Day, San Francisco, 1964. Originally published as Absolutnaya Ustoichivost' Regulirayemykh Sistem by The Academy of Sciences of the USSR, Moscow, 1963.
2. A. ALEMAN, On some generalizations of convex sets and convex functions, Anal. Numér. Théor. Approx., 14 (1985), pp. 1-6.
3. M. ANITESCU, Degenerate nonlinear programming with a quadratic growth condition, SIAM J. Optim., 10 (2000), pp. 1116-1135.
4. M. ANITESCU, A superlinearly convergent sequential quadratically constrained quadratic programming algorithm for degenerate nonlinear programming, SIAM J. Optim., 12 (2002), pp. 949-978.
5. Y.-H. AU-YEUNG, A theorem on a mapping from a sphere to the circle and the simultaneous diagonalization of two Hermitian matrices, Proc. Amer. Math. Soc., 20 (1969), pp. 545-548.
6. Y.-H. AU-YEUNG AND Y. T. POON, A remark on the convexity and positive definiteness concerning Hermitian matrices, South East Asian Bull. Math., 3 (1979), pp. 85-92.
7. Y.-H. AU-YEUNG AND N.-K. TSING, An extension of the Hausdorff-Toeplitz theorem on the numerical range, Proc. Amer. Math. Soc., 89 (1983), pp. 215-218.
8. A. I. BARVINOK, Feasibility testing for systems of real quadratic equations, Discrete Comput. Geom., 10 (1993), pp. 1-13.
9. A. I. BARVINOK, A remark on the rank of positive semidefinite matrices subject to affine constraints, Discrete Comput. Geom., 25 (2001), pp. 23-31.
10. S. BASU, R. POLLACK, AND M.-F. ROY, Algorithms in Real Algebraic Geometry, Springer-Verlag, Berlin, 2003.
11. A. BEN-TAL AND A. NEMIROVSKI, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS/SIAM Ser. Optim. 2, SIAM, Philadelphia, 2001.
12. A. BEN-TAL AND M. TEBOULLE, Hidden convexity in some nonconvex quadratically constrained quadratic programming, Math. Programming, 72 (1996), pp. 51-63.
13. C. BERENSTEIN AND D. STRUPPA, Recent improvements in the complexity of the effective Nullstellensatz, Linear Algebra Appl., 157 (1991), pp. 203-215.
14. J. BOCHNAK, M. COSTE, AND M.-F. ROY, Real Algebraic Geometry, Springer-Verlag, Berlin, 1998.
15. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in System and Control Theory, SIAM Stud. Appl. Math. 15, SIAM, Philadelphia, 1994.
16. W. W. BRECKNER AND G. KASSAY, A systemization of convexity concepts for sets and functions, J. Convex Anal., 4 (1997), pp. 109-127.
17. L. BRICKMAN, On the field of values of a matrix, Proc. Amer. Math. Soc., 12 (1961), pp. 61-66.
18. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Trust-Region Methods, MPS/SIAM Ser. Optim. 1, SIAM, Philadelphia, 2000.
19. E. DE KLERK, C. ROOS, AND T. TERLAKY, Nonlinear Optimization, Lecture notes, Delft University of Technology, Delft, The Netherlands, 2003.
20. K. DERINKUYU, M. Ç. PINAR, AND A. CAMCI, An improved probability bound for the approximate S-lemma, Oper. Res. Lett., to appear; DOI 10.1016/j.orl.2007.02.003.
21. K. DERINKUYU AND M. Ç. PINAR, On the S-procedure and some variants, Math. Methods Oper. Res., 64 (2006), pp. 55-77.
22. L. L. DINES, On the mapping of quadratic forms, Bull. Amer. Math. Soc., 47 (1941), pp. 494-498.
23. L. L. DINES, On linear combinations of quadratic forms, Bull. Amer. Math. Soc., 49 (1943), pp. 388-393.
24. K. FAN, Minimax theorems, Proc. Natl. Acad. Sci., 39 (1953), pp. 42-47.
25. L. FAYBUSOVICH, Jordan-algebraic approach to convexity theorems for quadratic mappings, SIAM J. Optim., 17 (2006), pp. 558-576.
26. P. FINSLER, Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen, Comment. Math. Helv., 9 (1937), pp. 188-192.
27. A. L. FRADKOV AND V. A. YAKUBOVICH, The S-procedure and a duality relation in nonconvex problems of quadratic programming, Vestnik Leningrad. Univ., 5 (1979), pp. 101-109.
28. T. FUJIE AND M. KOJIMA, Semidefinite programming relaxation for nonconvex quadratic programs, J. Global Optim., 10 (1997), pp. 367-380.
29. D. GOLDFARB AND G. IYENGAR, Robust portfolio selection problems, Math. Oper. Res., 28 (2003), pp. 1-38.
30. P. GRIFFITHS AND J. HARRIS, Principles of Algebraic Geometry, Wiley Classics Library, John Wiley & Sons, New York, 1994.
31. D. GRIGORIEV AND D. V. PASECHNIK, Polynomial-time computing over quadratic maps I: Sampling in real algebraic sets, Comput. Complexity, 14 (2005), pp. 20-52.
32. E. GUTKIN, E. A. JONCKHEERE, AND M. KAROW, Convexity of the joint numerical range: Topological and differential geometric viewpoints, Linear Algebra Appl., 376 (2004), pp. 143-171.
33. K. HAGELE, J. E. MORAIS, L. M. PARDO, AND M. SOMBRA, On the intrinsic complexity of the arithmetic Nullstellensatz, J. Pure Appl. Algebra, 146 (2000), pp. 103-183.
34. F. HAUSDORFF, Der Wertvorrat einer Bilinearform, Math. Zentralblatt, 3 (1919), pp. 314-316.
35. M. R. HESTENES AND E. J. MCSHANE, A theorem on quadratic forms and its application in the calculus of variations, Trans. Amer. Math. Soc., 47 (1940), pp. 501-512.
36. J.-B. HIRIART-URRUTY, Conditions for global optimality 2, J. Global Optim., 13 (1998), pp. 349-367.
37. J.-B. HIRIART-URRUTY, Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints, J. Global Optim., 21 (2001), pp. 445-455.
38. A. E. HOERL AND R. W. KENNARD, Ridge regression: Biased estimation for nonorthogonal problems, Technometrics, 12 (1970), pp. 55-67.
39. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
40. T. ILLÉS, I. JOÓ, AND G. KASSAY, On a Nonconvex Farkas Theorem and Its Application in Optimization Theory, Report 1992-03, Eötvös University, Budapest, Hungary, 1992.
41. T. ILLÉS AND G. KASSAY, Farkas type theorems for generalized convexities, Pure Math. Appl., 5 (1994), pp. 225-239.
42. T. ILLÉS AND G. KASSAY, Theorems of the alternative and optimality conditions for convexlike and general convexlike programming, J. Optim. Theory Appl., 101 (1999), pp. 243-257.
43. U. T. JÖNSSON, A Lecture on the S-procedure, Lecture notes, Division of Optimization and Systems Theory, Royal Institute of Technology, Stockholm, Sweden, 2001.
44. S. KIM AND M. KOJIMA, Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations, Comput. Optim. Appl., 26 (2003), pp. 143-154.
45. M. KOJIMA AND L. TUNÇEL, On the finite convergence of successive SDP relaxation methods, European J. Oper. Res., 143 (2002), pp. 325-341.
46. J. KOLLÁR, Sharp effective Nullstellensatz, J. Amer. Math. Soc., 1 (1988), pp. 963-975.
47. H. KÖNIG, Über das von Neumannsche Minimax-Theorem, Arch. Math. (Basel), 19 (1968), pp. 482-487.
48. J. LEVIN, Mathematical models for determining the intersections of quadric surfaces, Comput. Graphics Image Process., 11 (1979), pp. 73-87.
49. C.-K. LI AND Y.-T. POON, Convexity of the joint numerical range, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 668-678.
50. Z.-Q. LUO, Applications of convex optimization in signal processing and digital communication, Math. Programming, 97 (2003), pp. 177-207.
51. Z.-Q. LUO, J. F. STURM, AND S. ZHANG, Multivariate nonnegative quadratic mappings, SIAM J. Optim., 14 (2004), pp. 1140-1162.
52. A. I. LUR'E AND V. N. POSTNIKOV, On the theory of stability of control systems, Prikl. Mat. i Mekh., 8 (1944), pp. 3-13.
53. A. MEGRETSKY, S-Procedure in Optimal Non-stochastic Filtering, Technical Report TRITA/MAT-92-0015, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 1992.
54. A. MEGRETSKY AND S. TREIL, Power distribution in optimization and robustness of uncertain systems, J. Math. Systems Estim. Control, 3 (1993), pp. 301-319.
55. A. NEMIROVSKI, C. ROOS, AND T. TERLAKY, On maximization of quadratic forms over intersection of ellipsoids with common center, Math. Programming, 86 (1999), pp. 463-473.
56. R. ORTEGA, An energy amplification condition for decentralized adaptive stabilization, IEEE Trans. Automat. Control, 41 (1996), pp. 285-288.
57. G. PATAKI, On the Facial Structure of Cone-LP's and Semidefinite Programs, Management Science Research Report MSRR-#595, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1994.
58. G. PATAKI, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues, Math. Oper. Res., 23 (1998), pp. 339-358.
59. J.-M. PENG AND Y.-X. YUAN, Optimality conditions for the minimization of a quadratic with two quadratic constraints, SIAM J. Optim., 7 (1997), pp. 579-594.
60. H. PÉPIN, Revue de la filière Mathématiques (RMS), 3 (2004), pp. 171-172. Answer to a problem posed by J.-B. Hiriart-Urruty.
61. E. PESONEN, Über die Sprektraldarstellung quadratischer Formen in linearen Räumen mit indefiniter Metrik, Ann. Acad. Sci. Fenn. Ser. A. I. 227, Finnish Academy of Sciences, 1956.
62. 1 unit ball, RAIRO Oper. Res., 40 (2006), pp. 253-265.
63. B. T. POLYAK, Convexity of quadratic transformations and its use in control and optimization, J. Optim. Theory Appl., 99 (1998), pp. 553-583.
64. B. T. POLYAK, Convexity of nonlinear image of a small ball with applications to optimization, Set-Valued Anal., 9 (2001), pp. 159-168.
65. Y. T. POON, On the convex hull of the multiform numerical range, Linear Multilinear Algebra, 37 (1994), pp. 221-223.
66. A. PRESTEL AND C. N. DELZELL, Positive Polynomials, Springer-Verlag, Berlin, 2001.
67. M. RAMANA AND A. J. GOLDMAN, Quadratic Maps with Convex Images, Report 36-94, Rutgers Center for Operations Research, Rutgers, New Brunswick, NJ, 1994.
68. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
69. M. SOMBRA, Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz, J. Pure Appl. Algebra, 117/118 (1991), pp. 565-559.
70. M. SOMBRA, A sparse effective Nullstellensatz, Adv. Appl. Math., 22 (1999), pp. 271-295.
71. R. J. STERN AND H. WOLKOWICZ, Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations, SIAM J. Optim., 5 (1995), pp. 286-313.
72. J. STOER AND C. WITZGALL, Convexity and Optimization in Finite Dimensions, Vol. I, Springer-Verlag, Heidelberg, 1970.
73. J. F. STURM AND S. ZHANG, On cones of nonnegative quadratic functions, Math. Oper. Res., 28 (2003), pp. 246-267.
74. O. TOEPLITZ, Das algebraische Analogon zu einem Satze von Fejér, Math. Z., 2 (1918), pp. 187-197.
75. P. TSENG, Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation, SIAM J. Optim., 14 (2003), pp. 268-283.
76. K. WEIERSTRASS, Zur Theorie der bilinearen und quadratischen Formen, Monatsberichte der Königl. Preuss, Akademie der Wissenschaften zu Berlin, May 1868, pp. 310-338.
77. D. XU AND S. ZHANG, Approximation Bounds for Quadratic Maximization with Semidefinite Programming Relaxation, Technical Report SEEM 2003-01, Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong, Hong Kong, 2003.
78. V. A. YAKUBOVICH, S-procedure in nonlinear control theory, Vestnik Leningrad. Univ., 1 (1971), pp. 62-77 (in Russian).
79. V. A. YAKUBOVICH, Minimization of quadratic functionals under quadratic constraints and the necessity of a frequency condition in the quadratic criterion for absolute stability of nonlinear control systems, Soviet Math. Dokl., 14 (1973), pp. 593-597.
80. V. A. YAKUBOVICH, S-procedure in nonlinear control theory, Vestnik Leningrad. Univ., 4 (1977), pp. 73-93 (English translation).
81. Y. YE AND S. ZHANG, New results on quadratic minimization, SIAM J. Optim., 14 (2003), pp. 245-267.
82. Y.-X. YUAN, On a subproblem of trust region algorithms for constrained optimization, Math. Programming, 47 (1990), pp. 53-63.