Mathematische Zeitschrift

, Volume 256, Issue 1, pp 99–112

SOS approximations of nonnegative polynomials via simple high degree perturbations


DOI: 10.1007/s00209-006-0061-8

Cite this article as:
Lasserre, J.B. & Netzer, T. Math. Z. (2007) 256: 99. doi:10.1007/s00209-006-0061-8


We show that every real polynomial f nonnegative on [−1,1]n can be approximated in the l1-norm of coefficients, by a sequence of polynomials \({\{f_{\epsilon r}\}}\) that are sums of squares (s.o.s). This complements the existence of s.o.s. approximations in the denseness result of Berg, Christensen and Ressel, as we provide a very simple and explicit approximation sequence. Then we show that if the moment problem holds for a basic closed semi-algebraic set \({K_{S} \subset \mathbb{R}^n}\) with nonempty interior, then every polynomial nonnegative on KS can be approximated in a similar fashion by elements from the corresponding preordering. Finally, we show that the degree of the perturbation in the approximating sequence depends on \({\epsilon}\) as well as the degree and the size of coefficients of the nonnegative polynomial f, but not on the specific values of its coefficients.


Real algebraic geometryPositive polynomialsSum of squaresSemidefinite programmingMoment problem

Mathematics Subject Classification (1991)


Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  1. 1.LAAS-CNRS and Institute of MathematicsLAASToulouse cedex 4France
  2. 2.Universität Konstanz, Fachbereich Mathematik und StatistikKonstanzGermany