A Survey of the S-Lemma

@article{Plik2007ASO,
  title={A Survey of the S-Lemma},
  author={Imre P{\'o}lik and Tam{\'a}s Terlaky},
  journal={SIAM Rev.},
  year={2007},
  volume={49},
  pages={371-418}
}
In this survey we review the many faces of the S-lemma, a result about the correctness of the S-procedure. The basic idea of this widely used method came from control theory but it has important consequences in quadratic and semidefinite optimization, convex geometry, and linear algebra as well. These were all active research areas, but as there was little interaction between researchers in these different areas, their results remained mainly isolated. Here we give a unified analysis of the… 

Figures from this paper

On the S-Lemma for Univariate Polynomials

The so-called S-lemma has played an important role in optimization, both in theory and in applications. The significance of S-lemma is especially pronounced in control theory, robust optimization,

Higher degree S-lemma and the stability of quadratic modules

In this work we will investigate a certain generalization of the so called S-lemma in higher degrees. The importance of this generalization is, that it is closely related to Hilbert's 1888 theorem

An Extension of Yuan’s Lemma and Its Applications in Optimization

  • G. Haeser
  • Mathematics, Computer Science
    J. Optim. Theory Appl.
  • 2017
TLDR
An extension of Yuan’s lemma to more than two matrices, as long as the set of matrices has rank at most 2 is proved, to prove the classical second-order optimality condition to problems with quadratic constraints and without constant rank of the Jacobian matrix.

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

Polyak's convexity theorem, Yuan's lemma and S-lemma: extensions and applications

We extend Polyak’s theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive

A new dual for quadratic programming and its applications

The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since

Connectivity of Quadratic Hypersurfaces and Its Applications in Optimization, Part I: General Theory

TLDR
A basic theory on the connectivity of quadratic hypersurfaces is established and several connectivity theorems on quadratics functions that combine and generalize Dines's and Brickman's results on the hidden convexity of Quadratic mappings in real field are proved.

A new algorithm for concave quadratic programming

TLDR
A new dual is presented, in which, the dual variables are affine functions, and it is demonstrated that the dual of the bound is a semi-definite relaxation of quadratic programs.

Generalized S-Lemma and strong duality in nonconvex quadratic programming

TLDR
A simple and unified approach is developed to Lagrange duality in nonconvex quadratic programming and diverse generalizations as well as equivalent forms of the S-Lemma are derived along with new strong duality conditions for multiple constrained quadratics optimization.

Farkas’ lemma: three decades of generalizations for mathematical optimization

In this paper we present a survey of generalizations of the celebrated Farkas’s lemma, starting from systems of linear inequalities to a broad variety of non-linear systems. We focus on the
...

References

SHOWING 1-10 OF 110 REFERENCES

Lectures on modern convex optimization - analysis, algorithms, and engineering applications

TLDR
The authors present the basic theory of state-of-the-art polynomial time interior point methods for linear, conic quadratic, and semidefinite programming as well as their numerous applications in engineering.

Sharp effective Nullstellensatz

The usual proofs of this result, however, give no information about the g1's; for instance they give no bound on their degrees. This question was first considered by G. Hermann [H]. She used

A Lecture on the S-Procedure

The purpose of this lecture is to give an introduction to the the S-procedure and its use in systems and control applications. The notion S-procedure was coined by researches in the former Soviet

On the mapping of quadratic forms

The development of this paper was suggested by a theorem proposed by Bliss, proved by Albert, by Reid, and generalized by Hestenes and McShane. That theorem had to do with two quadratic forms P(z)

A Sparse Effective Nullstellensatz

TLDR
A degree bound is derived which can substantially improve the known polynomials in the Nullstellensatz in case of a sparse system and the notion of algebraic degree associated to a polynomial system of equations is introduced.

Principles of Algebraic Geometry

A comprehensive, self-contained treatment presenting general results of the theory. Establishes a geometric intuition and a working facility with specific geometric practices. Emphasizes applications

Multivariate Nonnegative Quadratic Mappings

TLDR
This paper considers the set (cone) of nonnegative quadratic mappings, defined with respect to the positive semidefinite matrix cone, and study when it can be represented by linear matrix inequalities.

ON THE FIELD OF VALUES OF A MATRIX

W is clearly a compact and connected set. Toeplitz showed in [3] that W has a convex outer boundary, and a short time later F. Hausdorff [1] proved that W itself is convex. Since then several

Jordan-Algebraic Approach to Convexity Theorems for Quadratic Mappings

We describe a Jordan-algebraic version of results related to convexity of images of quadratic mappings as well as related results on exactness of symmetric relaxations of certain classes of nonconvex
...