An effective version of Schm\"udgen's Positivstellensatz for the hypercube
Monique Laurent, Lucas Slot

TL;DR
This paper provides an explicit degree bound for Schmüdgen's Positivstellensatz certificates on the hypercube, showing they can be achieved with polynomials of degree proportional to 1 over the square root of the approximation parameter.
Contribution
The paper establishes a quadratic improvement in the degree bounds for Schmüdgen's certificates specifically on the hypercube, using the polynomial kernel method.
Findings
Degree of certificates is O(1/√η) for hypercube
Improves previous bound of O(1/η)
Uses polynomial kernel method and Jackson kernel
Abstract
Let be a compact semialgebraic set and let be a polynomial nonnegative on . Schm\"udgen's Positivstellensatz then states that for any , the nonnegativity of on can be certified by expressing as a conic combination of products of the polynomials that occur in the inequalities defining , where the coefficients are (globally nonnegative) sum-of-squares polynomials. It does not, however, provide explicit bounds on the degree of the polynomials required for such an expression. We show that in the special case where is the hypercube, a Schm\"udgen-type certificate of nonnegativity exists involving only polynomials of degree . This improves quadratically upon the previously best known estimate in . Our proof relies on an application of the polynomial kernel method, making use…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Mathematical functions and polynomials · Advanced Optimization Algorithms Research
