Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization

  title={Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization},
  author={Etienne de Klerk and Roxana Hess and Monique Laurent},
  journal={SIAM J. Optim.},
We consider the problem of minimizing a given $n$-variate polynomial $f$ over the hypercube $[-1,1]^n$. An idea introduced by Lasserre, is to find a probability distribution on $[-1,1]^n$ with polynomial density function $h$ (of given degree $r$) that minimizes the expectation $\int_{[-1,1]^n} f(x)h(x)d\mu(x)$, where $d\mu(x)$ is a fixed, finite Borel measure supported on $[-1,1]^n$. It is known that, for the Lebesgue measure $d\mu(x) = dx$, one may show an error bound $O(1/\sqrt{r})$ if $h$ is… 

Figures and Tables from this paper

Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
The rate of convergence of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre, is shown to be O(1/r^2) and a class of polynomials of any positive degree for which this rate is tight.
Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube
Lower bounds on the convergence rate for both hierarchies match the upper bounds and thus establish the true rate of convergence on these examples, determined by the distribution of extremal zeroes of certain families of orthogonal polynomials.
Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing
It is shown that, when f is a polynomial and K a convex body, this comparison yields a faster rate of convergence of the Lasserre hierarchy than what was previously known in the literature.
Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures
It is shown that in the general case the minimum can be approximated as closely as desired from above with a hierarchy of semidefinite programs problems or, in the particular case of a single fraction, with a hierarchical of generalized eigenvalue problems.
Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
It is shown that the hierarchies based on the Schmüdgen-type certificates converge to the global minimum of f at a rate in O(1/r2), matching recently obtained convergence rates for the hypersphere and hypercube.
An effective version of Schm\"udgen's Positivstellensatz for the hypercube
Let S ⊆ Rn be a compact semialgebraic set and let f be a polynomial nonnegative on S. Schmüdgen’s Positivstellensatz then states that for any η > 0, the nonnegativity of f + η on S can be certified
A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
This work will review some results on inner and inner conic approximations of the convex cone of positive Borel measures, with a special focus on the convergence rate of the hierarchies of upper and lower bounds for the general problem of moments that are obtained from these inner and outer approximation.
Algebraic perspectives on signomial optimization
Signomials are obtained by generalizing polynomials to allow for arbitrary real exponents. This generalization offers great expressive power, but has historically sacrificed the organizing principle
Some approximation schemes in polynomial optimization
  • R. Hess
  • Mathematics, Computer Science
  • 2017
This thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semidefinite programming problems in polynomial optimization, commonly called the Lasserre hierarchy, and constructs a modification of it for which an improved convergence rate can be proved.


Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization
A hierarchy of upper bounds proposed by Lasserre is analyzed, obtained by searching for an optimal probability density function h on K which is a sum of squares of polynomials, so that the rate of convergence is no worse than O(1/r), where 2r is the degree bound on the density function.
A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
A convergent explicit hierarchy of semidefinite (outer) approximations with {\it no} lifting is obtained, of the cone of nonnegative polynomials of degree at most $d$, used in polynomial optimization on certain simple closed sets.
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
This work provides a monotone nonincreasing sequence of upper bounds fkH(k≥1) converging to the global minimum of a polynomial f on simple sets like the unit hypercube in ℝn and shows a stronger convergence rate in O(1/k) for quadratic polynomials and more generally for polynoms having a rational minimizer in the hypercube.
A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds
A primal-dual active set method for quadratic problems with bound constraints is presented which extends the infeasible active set approach of Kunisch and Rendl and performs well in practice.
Global Optimization with Polynomials and the Problem of Moments
It is shown that the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): R n to R, in a compact set K defined byPolynomial inequalities reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems.
Polynomials that are positive on an interval
This paper discusses representations of polynomials that are positive on intervals of the real line. An elementary and constructive proof of the following is given: If h(x), p(x) ∈ R[x] such that {α
Sums of Squares, Moment Matrices and Optimization Over Polynomials
This work considers the problem of minimizing a polynomial over a semialgebraic set defined byPolynomial equations and inequalities, which is NP-hard in general and reviews the mathematical tools underlying these properties.
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
An error analysis of Handelman hierarchy applied to the special class of polynomial programs and its implications in the computation of the combinatorial optimization problems are presented.
TheK-moment problem for compact semi-algebraic sets
In this chapter we begin the study of the multidimensional moment problem. The passage to dimensions d ≥ 2 brings new difficulties and unexpected phenomena. In Sect. 3.2 we derived solvability
Rank of Handelman hierarchy for Max-Cut