Global optimization via the dual SONC cone and linear programming

DOI10.1145/3373207.3404043MaRDI QIDQ5145965zbMATH OpenOpenAlexWikidataFDO

Authors Mareike Dressler, Janin Heuer, Helen Naumann, Timo de Wolff

Publication date 22 January 2021

Published in Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

circuit polynomialdual conelinear programmingnonconvex global optimizationSONC

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited in

(8)

• Real zeros of SONC polynomials
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
• SONC optimization and exact nonnegativity certificates via second-order cone programming
• Symmetry reduction in AM/GM-based optimization
• A unified framework of SAGE and SONC polynomials and its duality theory
• Global Optimization via the Dual SONC Cone and Linear Programming
• The duality of SONC: advances in circuit-based certificates
• Moments, sums of squares, and tropicalization

This page was built for publication: Global optimization via the dual SONC cone and linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145965)