Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

  title={Bound-Constrained Polynomial Optimization Using Only Elementary Calculations},
  author={Etienne de Klerk and Jean Bernard Lasserre and Monique Laurent and Zhao Sun},
  journal={Math. Oper. Res.},
We provide 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. The novelty with respect to the converging sequence of upper bounds in Lasserre [Lasserre JB (2010) A new look at nonnegativity on closed sets and polynomial optimization, SIAM J. Optim. 21:864–885] is that only elementary computations are required. For optimization over the hypercube [0, 1]n, we show that the new bounds fkH have… 

Figures and Tables from this paper

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.
Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
This work presents a framework to compute lower bounds on largest absolute roundoff errors, for a particular rounding model, and investigates the efficiency and precision of the method on nontrivial polynomial programs coming from space control, optimization, and computational biology.
Certified Lower Bounds of Roundoff Errors using Semidefinite Programming
This study presents a framework to compute lower bounds of absolute roundoff errors for numerical programs implementing polynomial functions with box constrained input variables using semidefinite programming (SDP) relaxations and is complementary of over-approximation frameworks, consisting of obtaining upper bounds for theabsolute roundoff error.
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.
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
Homogenization for polynomial optimization with unbounded sets
This paper considers polynomial optimization with unbounded sets. We give a homogenization formulation and propose a hierarchy of MomentSOS relaxations to solve it. Under the assumptions that the
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.
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
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
Decomposition Methods for Nonlinear Optimization and Data Mining
  • B. Dutra
  • Computer Science, Mathematics
  • 2016
This dissertation focuses on the problem of maximizing a polynomial function over the continuous domain of a polytope, which is NP-hard, but develops approximation methods that run inPolynomial time when the dimension is fixed.


An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
This paper considers a rational approximation by taking the minimum over the regular grid, which consists of rational points with denominator $r$ (for given $r) and shows that the associated convergence rate is $O(1/r^2)$ for quadratic polynomials.
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.
A PTAS for the minimization of polynomials of fixed degree over the simplex
Global optimization of rational functions: a semidefinite programming approach
It is shown that in the univariate case (n = 1), these problems have exact reformulations as semidefinite programming (SDP) problems, by using reformulations introduced in the PhD thesis of Jibetean [16].
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
We consider the problem of minimizing a polynomial on the hypercube $[0,1]^n$ and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem corresponding to
Representing polynomials by positive linear functions on compact convex polyhedra.
If K is a compact polyhedron in Euclidean έ/-space, defined by linear inequalities, βt > 0, and if / is a polynomial in d variables that is strictly positive on AT, then / can be expressed as a
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.
Moments, Positive Polynomials And Their Applications
The semidefinite programming methodology to solve the generalized problem of moments is presented and several applications of the GPM are described in detail (notably in optimization, probability, optimal control andmathematical finance).
Semidefinite Programming vs. LP Relaxations for Polynomial Programming
  • J. Lasserre
  • Mathematics, Computer Science
    Math. Oper. Res.
  • 2002
Two hierarchies of relaxations are compared, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and recent semidefinite programming (SDP) relaxations introduced by the author.
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
This paper shows how to approximate the optimal solution by approximating the cone of copositive matrices via systems of linear inequalities, and, more refined, linear matrix inequalities (LMI's).