A Sum of Squares Approximation of Nonnegative Polynomials

DOI10.1137/070693709zbMath1129.12004arXivmath/0412398OpenAlexW1981437696WikidataQ56523172 ScholiaQ56523172MaRDI QIDQ5432390

Jean-Bernard Lasserre

Publication date: 3 January 2008

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0412398

zbMATH Keywords

global optimizationsums of squaressemidefinite programmingmoment problemsrelaxationspositive semidefinite polynomialsKarush Kuhn Tucker multipliers.Putinar's representation theorem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)

Related Items (13)

Random graphons and a weak Positivstellensatz for graphs ⋮ Nonlinear analysis of vehicle control actuations based on controlled invariant sets ⋮ On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials ⋮ Positivity certificates and polynomial optimization on non-compact semialgebraic sets ⋮ Bounds-constrained polynomial approximation using the Bernstein basis ⋮ Positive graphs ⋮ Constraints on flavored 2d CFT partition functions ⋮ Analysis of optimization algorithms via sum-of-squares ⋮ Data-driven optimal control with a relaxed linear program ⋮ In SDP Relaxations, Inaccurate Solvers Do Robust Optimization ⋮ A unified framework of SAGE and SONC polynomials and its duality theory ⋮ An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions ⋮ Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization

Uses Software

• Sostools

This page was built for publication: A Sum of Squares Approximation of Nonnegative Polynomials