Representation of positive polynomials on a generalized strip and its application to polynomial optimization

Abstract

We study the representation of nonnegative polynomials in two variables on a certain class of unbounded closed basic semi-algebraic sets (which are called generalized strips). This class includes the strip \([a,b] \times {\mathbb {R}}\) which was studied by Marshall in (Proc Am Math Soc 138(5):1559–1567, 2010). A denominator-free Nichtnegativstellensätz holds true on a generalized strip when the width of the generalized strip is constant and fails otherwise. As a consequence, we confirm that the standard hierarchy of semidefinite programming relaxations defined for the compact case can indeed be adapted to the generalized strip with constant width. For polynomial optimization problems on the generalized strip with non-constant width, we follow Ha-Pham’s work: Solving polynomial optimization problems via the truncated tangency variety and sums of squares.