Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube

Authors:
Etienne de Klerk;Monique Laurent
Affiliations:
E.deKlerk@uvt.nl;M.Laurent@cwi.nl
Venue:
SIAM Journal on Optimization
Year:
2010

Citing 13
Cited 1

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Some optimal inapproximability results

Journal of the ACM (JACM)
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs

SIAM Journal on Optimization
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming

Journal of Global Optimization
Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Mathematics of Operations Research
On the complexity of Schmüdgen's positivstellensatz

Journal of Complexity
Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimizing Polynomials via Sum of Squares over the Gradient Ideal

Mathematical Programming: Series A and B
A PTAS for the minimization of polynomials of fixed degree over the simplex

Theoretical Computer Science - Approximation and online algorithms
Semidefinite representations for finite varieties

Mathematical Programming: Series A and B
On the complexity of Putinar's Positivstellensatz

Journal of Complexity
Convexity in SemiAlgebraic Geometry and Polynomial Optimization

SIAM Journal on Optimization

Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the Positivstellensatz of Schmüdgen [Math. Ann., 289 (1991), pp. 203-206]. The main tool we employ is Bernstein approximations of polynomials, which also gives constructive proofs and degree bounds for positivity certificates on the hypercube.