arXiv Analytics

Sign in

arXiv:1009.0125 [math.OC]AbstractReferencesReviewsResources

A new look at nonnegativity on closed sets and polynomial optimization

Jean B. Lasserre

Published 2010-09-01, updated 2011-05-12Version 3

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$ is compact $\mu$ is an arbitrary finite Borel measure with support equal to K. In particular, we obtain a convergent explicit hierarchy of semidefinite (outer) approximations with {\it no} lifting, of the cone of nonnegative polynomials of degree at most $d$. Wen used in polynomial optimization on certain simple closed sets $\K$ (like e.g., the whole space $\R^n$, the positive orthant, a box, a simplex, or the vertices of the hypercube), it provides a nonincreasing sequence of upper bounds which converges to the global minimum by solving a hierarchy of semidefinite programs with only one variable. This convergent sequence of upper bounds complements the convergent sequence of lower bounds obtained by solving a hierarchy of semidefinite relaxations.

Related articles: Most relevant | Search more
arXiv:1505.00233 [math.OC] (Published 2015-05-01)
Local Versus Global Conditions in Polynomial Optimization
arXiv:0707.2353 [math.OC] (Published 2007-07-16, updated 2007-11-08)
Another proof for the equivalence between invariance of closed sets with respect to stochastic and deterministic systems
arXiv:2501.06052 [math.OC] (Published 2025-01-10)
Rank conditions for exactness of semidefinite relaxations in polynomial optimization