Nonnegative Polynomial with no Certificate of Nonnegativity in the Simplicial Bernstein Basis
Christoffer Sloth

TL;DR
This paper constructs a specific nonnegative polynomial that defies representation with nonnegative coefficients in the simplicial Bernstein basis, highlighting limitations of Bernstein's theorem in certifying nonnegativity.
Contribution
It provides a counterexample demonstrating that Bernstein's theorem does not extend to certificates of nonnegativity for polynomials with isolated zeros.
Findings
Counterexample of a nonnegative polynomial with no Bernstein basis certificate
Shows limitations of Bernstein's theorem in polynomial nonnegativity certification
Highlights need for alternative methods in polynomial nonnegativity proofs
Abstract
This paper presents a nonnegative polynomial that cannot be represented with nonnegative coefficients in the simplicial Bernstein basis by subdividing the standard simplex. The example shows that Bernstein Theorem cannot be extended to certificates of nonnegativity for polynomials with zeros at isolated points.
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 Numerical Analysis Techniques · Polynomial and algebraic computation · Advanced Optimization Algorithms Research
