Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size

DOI10.1016/j.jsc.2023.102254arXiv2305.19039MaRDI QIDQ6051120

Maria M. Davis, David Papp

Publication date: 19 September 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.19039

zbMATH Keywords

polynomial optimizationconic programmingcomputational real algebraic geometrynonnegativity certificatessums-of-squares decomposition

Mathematics Subject Classification ID

Semidefinite programming (90C22) Polynomial optimization (90C23) Computational real algebraic geometry (14Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rational certificates of positivity on compact semialgebraic sets
• Certificates of positivity in the Bernstein basis
• The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
• Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
• Dual optimal design and the Christoffel-Darboux polynomial
• On exact Reznick, Hilbert-Artin and Putinar's representations
• A disintegration of the Christoffel function
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Sum-of-Squares Optimization without Semidefinite Programming
• Semidefinite Optimization and Convex Algebraic Geometry
• Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets
• Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming
• A unified framework of SAGE and SONC polynomials and its duality theory
• Algorithms in real algebraic geometry

This page was built for publication: Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size