Error bounds for polynomial optimization over the hypercube using Putinar type representations

DOI10.1007/s11590-014-0797-8zbMath1342.90126arXiv1404.6145OpenAlexW1965662620MaRDI QIDQ2355314

Victor Magron

Publication date: 22 July 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.6145

zbMATH Keywords

semidefinite programmingPositivstellensatzpreorderingpositive polynomialquadratic modulemultivariate Bernstein approximationsums of squares relaxations

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Semialgebraic sets and related spaces (14P10)

Related Items (4)

A few more extensions of Putinar's Positivstellensatz to non-compact sets ⋮ Degree Bounds for Putinar’s Positivstellensatz on the Hypercube ⋮ An effective version of Schmüdgen's Positivstellensatz for the hypercube ⋮ A version of Putinar's Positivstellensatz for cylinders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of Putinar's Positivstellensatz
• On the complexity of Schmüdgen's Positivstellensatz
• Representing polynomials by positive linear functions on compact convex polyhedra
• The \(K\)-moment problem for compact semi-algebraic sets
• Semidefinite programming relaxations for semialgebraic problems
• Global Optimization with Polynomials and the Problem of Moments
• Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube

This page was built for publication: Error bounds for polynomial optimization over the hypercube using Putinar type representations