Degree bounds for Putinar's Positivstellensatz on the hypercube

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Baldi, Lorenzo, Slot, Lucas
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916624519397376
author Baldi, Lorenzo
Slot, Lucas
author_facet Baldi, Lorenzo
Slot, Lucas
contents The Positivstellensätze of Putinar and Schmüdgen show that any polynomial $f$ positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of these results, namely to show bounds on the required degree of the sums of squares in such representations. These effective Positivstellensätze have direct implications for the convergence rate of the celebrated moment-SOS hierarchy in polynomial optimization. In this paper, we restrict to the fundamental case of the hypercube $\mathrm{B}^{n} = [-1, 1]^n$. We show an upper degree bound for Putinar-type representations on $\mathrm{B}^{n}$ of the order $O(f_{\max}/f_{\min})$, where $f_{\max}$, $f_{\min}$ are the maximum and minimum of $f$ on $\mathrm{B}^{n}$, respectively. Previously, specialized results of this kind were available only for Schmüdgen-type representations and not for Putinar-type ones. Complementing this upper degree bound, we show a lower degree bound in $Ω(\sqrt[8]{f_{\max}/f_{\min}})$. This is the first lower bound for Putinar-type representations on a semialgebraic set with nonempty interior described by a standard set of inequalities.
format Preprint
id arxiv_https___arxiv_org_abs_2302_12558
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Degree bounds for Putinar's Positivstellensatz on the hypercube
Baldi, Lorenzo
Slot, Lucas
Algebraic Geometry
Commutative Algebra
Optimization and Control
13J30, 14P10, 90C23
The Positivstellensätze of Putinar and Schmüdgen show that any polynomial $f$ positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of these results, namely to show bounds on the required degree of the sums of squares in such representations. These effective Positivstellensätze have direct implications for the convergence rate of the celebrated moment-SOS hierarchy in polynomial optimization. In this paper, we restrict to the fundamental case of the hypercube $\mathrm{B}^{n} = [-1, 1]^n$. We show an upper degree bound for Putinar-type representations on $\mathrm{B}^{n}$ of the order $O(f_{\max}/f_{\min})$, where $f_{\max}$, $f_{\min}$ are the maximum and minimum of $f$ on $\mathrm{B}^{n}$, respectively. Previously, specialized results of this kind were available only for Schmüdgen-type representations and not for Putinar-type ones. Complementing this upper degree bound, we show a lower degree bound in $Ω(\sqrt[8]{f_{\max}/f_{\min}})$. This is the first lower bound for Putinar-type representations on a semialgebraic set with nonempty interior described by a standard set of inequalities.
title Degree bounds for Putinar's Positivstellensatz on the hypercube
topic Algebraic Geometry
Commutative Algebra
Optimization and Control
13J30, 14P10, 90C23
url https://arxiv.org/abs/2302.12558