SOS approximations of nonnegative polynomials via simple high degree perturbation
Abstract
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 r\ that are sums of squares. 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 KS⊂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 ε as well as the degree and the size of coefficients of the nonnegative polynomial f, but not on the specific values of its coefficients.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.