On the exactness of Lasserre relaxations and pure states over real closed fields
arXiv:1710.07521 · doi:10.1007/s10208-018-9406-z
Abstract
Consider a finite system of non-strict polynomial inequalities with solution set . Its Lasserre relaxation of degree is a certain natural linear matrix inequality in the original variables and one additional variable for each nonlinear monomial of degree at most . It defines a spectrahedron that projects down to a convex semialgebraic set containing . In the best case, the projection equals the convex hull of . We show that this is very often the case for sufficiently high if is compact and "bulges outwards" on the boundary of its convex hull. Now let additionally a polynomial objective function be given, i.e., consider a polynomial optimization problem. Its Lasserre relaxation of degree is now a semidefinite program. In the best case, the optimal values of the polynomial optimization problem and its relaxation agree. We prove that this often happens if is compact and exceeds some bound that depends on the description of and certain characteristicae of like the mutual distance of its global minimizers on .
36 pages, to appear in Foundations of Computational Mathematics