Positive polynomials and semidefinite programming
This is a short survey (in German) of relatively recent (1998--2008) research activities at the border between optimization, numerical linear algebra, functional analysis and real algebraic geometry. The focus in on the use of semidefinite programming (linear programming in the convex cone of symmetric matrices with non-negative eigenvalues, see Section 5) to solve non-convex polynomial optimization problems (Section 6) or certify emptiness of semi-algebraic sets. These techniques rely on the primal problem of moments (Section 4) consisting in finding conditions under which an infinite or truncated sequence of real numbers represent moments of a measure supported on a given semi-algebraic set, and the dual problem of representing a polynomial positive on this set (Section 3). The survey concludes by sketching some current research directions in Section 7. For comprehensive surveys (in English) covering this material and much more, this reviewer recommends [\textit{J. W. Helton} and \textit{M. Putinar}, ``Positive polynomials in scalar and matrix variables, the spectral theorem and optimization, in: Operator theory, structured matrices, and dilations, Theta, Bucharest, 229--306 (2007; Zbl 1199.47001)] and [\textit{M. Laurent}, in: Emerging applications of algebraic geometry, Vol. 149 of IMA Volumes in Mathematics and its Applications, Springer, 157--270 (2009; Zbl 1163.13021)].
- Semidefinite programming relaxations for semialgebraic problems
- The approach of moments for polynomial equations
- An introduction to polynomial and semi-algebraic optimization
- Spectrahedral approximations of convex hulls of algebraic sets
- Moments and sums of squares for polynomial optimization and related problems
- Semidefinite optimization
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Moments, positive polynomials and their applications
- Polynomial optimization, sums of squares, and applications
- Semidefinite programming relaxations for semialgebraic problems
- Positive polynomials on fibre products
- Semidefinite characterization of sum-of-squares cones in algebras
- Polynomial optimization, sums of squares, and applications
- On a structured semidefinite program
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- scientific article; zbMATH DE number 4211369 (Why is no real title available?)
- Real ideal and the duality of semidefinite programming for polynomial optimization
- Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization
- Moment approximations for set-semidefinite polynomials
- scientific article; zbMATH DE number 70084 (Why is no real title available?)
- POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials
- Optimization Problems over Positive Pseudopolynomial Matrices
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization
- A matrix Positivstellensatz with lifting polynomials
- LMI Approximations for Cones of Positive Semidefinite Forms
- Positive trigonometric polynomials and signal processing applications
- Strict positivstellensätze for matrix polynomials with scalar constraints
- Linear optimization with cones of moments and nonnegative polynomials
- Moments and sums of squares for polynomial optimization and related problems
- Semidefinite representations for finite varieties
- A semidefinite programming approach to the generalized problem of moments
This page was built for publication: Positive polynomials and semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948606)
