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 the Positivstellensatz of Schm

• Type: Journal
• Year: 2010
• Where: SIAMJO
• Authors: Etienne de Klerk, Monique Laurent
• Keywords: Bernstein Approximation, Polynomials, Semidefinite Programming, SIAMJO 2010