Real Algebraic and Analytic Geometry
Submission: 2005, October 13.
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.
Mathematics Subject Classification (2000): 11E25, 13J30, 14P10.
Keywords and Phrases: Positivstellensatz, complexity, positive polynomial, sum of squares, preordering, moment problem, optimization of polynomials.
Full text, 15p.: dvi 68k, ps.gz 177k, pdf 226k.