S.o.s. approximation of polynomials nonnegative on a real algebraic set
Jean B. Lasserre
Abstract
With every real polynomial f, we associate a family \fεr\ε, r of real polynomials, in explicit form in terms of f and the parameters ε>0,r∈ N, and such that f-fεr1 0 as ε 0. Let V⊂ Rn be a real algebraic set described by finitely many polynomials equations gj(x)=0,j∈ J, and let f be a real polynomial, nonnegative on V. We show that for every ε>0, there exist nonnegative scalars \λj(ε)\j∈ J such that, for all r sufficiently large, fεr+Σj∈ J λj(ε) gj2, is a sum of squares. This representation is an obvious certificate of nonnegativity of fεr on V, and very specific in terms of the gj that define the set V. In particular, it is valid with no assumption on V. In addition, this representation is also useful from a computation point of view, as we can define semidefinite programing relaxations to approximate the global minimum of f on a real algebraic set V, or a semi-algebraic set K, and again, with no assumption on V or K.
Create a lesson
Related papers
Morphism spaces on low degree hypersurfaces
Hrishabh Mishra
Connecting families of curves
Nathan Chen, Robert Lazarsfeld, Federico Moretti
The Last Picard Rank 1 Double-Mirror Calabi-Yau Pair?
Michał Kapustka, Marco Rampazzo, Prajwal Samal
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers II
Connor Stewart
The Hurwitz existence problem in prime degree
Jijian Song, Hailin Wen, Zebao Zhang
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers I
Andrew Obus, Padmavathi Srinivasan, Connor Stewart