The dual cone of sums of non-negative circuit polynomials

DOI10.1515/advgeom-2020-0019zbMath1470.14117arXiv1809.07648OpenAlexW3136066621MaRDI QIDQ2035029

Helen Naumann, Mareike Dressler, Thorsten Theobald

Publication date: 23 June 2021

Published in: Advances in Geometry (Search for Journal in Brave)

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

zbMATH Keywords

polynomial optimizationpositive polynomialsdual conenon-negative circuit polynomialsrelative entropy function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Real algebraic sets (14P05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Duality of sum of nonnegative circuit polynomials and optimal SONC bounds, A unified framework of SAGE and SONC polynomials and its duality theory

Uses Software

• REPOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Relative entropy optimization and its applications
• Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
• Relative Entropy Relaxations for Signomial Optimization
• Semidefinite Optimization and Convex Algebraic Geometry
• A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
• Convex Bodies The Brunn-MinkowskiTheory
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization