Tangencies and Polynomial Optimization

Abstract

Given a polynomial function f Rn → R and a unbounded basic closed semi-algebraic set S ⊂ Rn, in this paper we show that the conditions listed below are characterized exactly in terms of the so-called tangency variety of f on S: (i) The f is bounded from below on S; (ii) The f attains its infimum on S; (iii) The sublevel set \x ∈ S \ | \ f(x) λ\ for λ ∈ R is compact; (iv) The f is coercive on S. Besides, we also provide some stability criteria for boundedness and coercivity of f on S.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…