On {\L}ojasiewicz Inequalities and the Effective Putinar's Positivstellensatz
Lorenzo Baldi (AROMATH, PolSys), Bernard Mourrain (AROMATH), Adam, Parusinski (LJAD)

TL;DR
This paper provides new bounds and a simplified proof for the effective Putinar's Positivstellensatz, linking the degree bounds to Łojasiewicz inequalities and analyzing their behavior under certain regularity conditions.
Contribution
The paper introduces improved degree bounds for positive polynomial representations on semi-algebraic sets, utilizing Łojasiewicz inequalities and analyzing their properties under constraint qualification.
Findings
New polynomial bounds involving Łojasiewicz parameters.
Simplified proof of the effective Putinar's Positivstellensatz.
Analysis of Łojasiewicz inequality when constraints satisfy CQ.
Abstract
The representation of positive polynomials on a semi-algebraic set in terms of sums of squares is a central question in real algebraic geometry, which the Positivstellensatz answers. In this paper, we study the effective Putinar's Positivestellensatz on a compact basic semi-algebraic set and provide a new proof and new improved bounds on the degree of the representation of positive polynomials. These new bounds involve a parameter measuring the non-vanishing of the positive function, the constant and exponent of a {\L}ojasiewicz inequality for the semi-algebraic distance function associated to the inequalities defining . They are polynomial in and with an exponent depending only on . We analyse in details the {\L}ojasiewicz inequality when the defining inequalities …
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
TopicsAdvanced Optimization Algorithms Research · Polynomial and algebraic computation · Matrix Theory and Algorithms
