S.o.s. approximation of polynomials nonnegative on a real algebraic set

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.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…