Best $\ell_1$-approximation of nonnegative polynomials by sums of squares
Jean Lasserre (LAAS)

TL;DR
This paper derives an explicit formula for the best -norm approximation of a nonnegative polynomial by sums of squares of a specified degree, advancing approximation techniques in polynomial optimization.
Contribution
It introduces a novel explicit expression for the best -norm approximation of nonnegative polynomials by sums of squares.
Findings
Provides explicit formula for approximation
Enhances polynomial optimization methods
Improves understanding of polynomial approximation
Abstract
Given a nonnegative polynomial f, we provide an explicit expression for its best -norm approximation by a sum of squares of given degree.
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 · Advanced Optimization Algorithms Research · Approximation Theory and Sequence Spaces
