We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and inequalities, which is NP-hard in general. Hierarchies of semidefinite relaxations have been proposed in the literature, involving positive semidefinite moment matrices and the dual theory of sums of squares of polynomials. We present these hierarchies of approximations and their main properties: asymptotic/finite convergence, optimality certificate, and extraction of global optimum solutions. We review the mathematical tools underlying these properties, in particular, some sums of squares representation results for positive polynomials, some results about moment matrices (in particular, of Curto and Fialkow), and the algebraic eigenvalue method for solving zero-dimensional systems of polynomial equations. We try whenever possible to provide detailed proofs and background

Additional Metadata
Keywords Positive polynomial, sum of squares of polynomials, moment problem, polynomial optimization, semidefinite programming
MSC Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (msc 13P10)
THEME Logistics (theme 3)
Publisher Springer
Editor M. Putinar , S. Sullivant
Series The IMA Volumes in Mathematics and its Applications
Project Semidefinite programming and combinatorial optimization
Citation
Laurent, M. (2009). Sums of squares, moment matrices and optimization over polynomials. In M Putinar & S Sullivant (Eds.), Emerging Applications of Algebraic Geometry (pp. 157–270). Springer.