Convexifying positive polynomials and sums of squares approximation
Krzysztof Kurdyka, Stanis{\l}aw Spodzieja

TL;DR
This paper demonstrates that nonnegative polynomials on certain sets can be uniformly approximated by sums of squares and explores conditions under which polynomial multiples become convex, with applications to semidefinite optimization.
Contribution
It introduces a new approximation scheme for nonnegative polynomials using sums of squares and provides criteria for polynomial convexification on semialgebraic sets.
Findings
Polynomials nonnegative on semialgebraic sets can be approximated by sums of squares plus boundary terms.
Conditions are established for when polynomial multiples are convex on convex semialgebraic sets.
Applications include methods for finding lower critical points in polynomial optimization.
Abstract
We show that if a polynomial is nonnegative on a closed basic semialgebraic set , where , then can be approximated uniformly on compact sets by polynomials of the form , where and are sums of squares of polynomials. In particular, if is compact, and is positive on , then for some sums of squares and , where . We apply a quantitative version of those results to semidefinite optimization methods. Let be a convex closed semialgebraic…
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 · Optimization and Variational Analysis · Iterative Methods for Nonlinear Equations
