On the exactness of Lasserre relaxations and pure states over real closed fields

Abstract

Consider a finite system of non-strict polynomial inequalities with solution set S⊂eq Rn. Its Lasserre relaxation of degree d is a certain natural linear matrix inequality in the original variables and one additional variable for each nonlinear monomial of degree at most d. It defines a spectrahedron that projects down to a convex semialgebraic set containing S. In the best case, the projection equals the convex hull of S. We show that this is very often the case for sufficiently high d if S is compact and "bulges outwards" on the boundary of its convex hull. Now let additionally a polynomial objective function f be given, i.e., consider a polynomial optimization problem. Its Lasserre relaxation of degree d 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 S is compact and d exceeds some bound that depends on the description of S and certain characteristicae of f like the mutual distance of its global minimizers on S.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…