arXiv · 0812.2657
On the complexity of Putinar's Positivstellensatz
Abstract
We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schmüdgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get information about the convergence rate of Lasserre's procedure for optimization of a polynomial subject to polynomial constraints.
Explore related subjects
Keep this discovery
Jiawang Nie, Markus Schweighofer. 2008-12-14. On the complexity of Putinar's Positivstellensatz. https://doi.org/10.1007/10.1016/j.jco.2006.07.002
Cite the original work for its findings. Save a collection to share your selection of sources.