SOS approximations of nonnegative polynomials via simple high degree perturbations |
| |
Authors: | Jean B Lasserre Tim Netzer |
| |
Institution: | 1.LAAS-CNRS and Institute of Mathematics,LAAS,Toulouse cedex 4,France;2.Universit?t Konstanz, Fachbereich Mathematik und Statistik,Konstanz,Germany |
| |
Abstract: | We show that every real polynomial f nonnegative on −1,1]
n
can be approximated in the l
1-norm of coefficients, by a sequence of polynomials 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 with nonempty interior, then every polynomial nonnegative on K
S
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 as well as the degree and the size of coefficients of the nonnegative polynomial f, but not on the specific values of its coefficients.
|
| |
Keywords: | Real algebraic geometry Positive polynomials Sum of squares Semidefinite programming Moment problem |
本文献已被 SpringerLink 等数据库收录! |
|