Optimality Conditions and Finite Convergence of Lasserre's Hierarchy I: Under Archimedeanness, the Classical Optimality Conditions at Every Global Minimizer Imply Finite ConvergenceResearch Paper
Polynomial optimization asks for the global minimum of a polynomial over a set cut out by polynomial equations and inequalities. It contains nonconvex quadratic programming, max-cut, and many problems from control and engineering. Lasserre's hierarchy (Lasserre 2001) replaces this problem by a sequence of semidefinite programs…