Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials

DOI10.1145/3326229.3326271zbMath1467.68230arXiv1902.02123OpenAlexW2960750222MaRDI QIDQ5121119

Victor Magron, Timo de Wolff, Henning Seidler

Publication date: 10 September 2020

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

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

zbMATH Keywords

convex optimizationgeometric programmingreal algebraic geometryhybrid numeric-symbolic algorithmrelative entropy programmingarithmetic-geometric-mean exponentialsexact certificatenonnegative circuitsrounding-projection procedure

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical optimization and variational techniques (65K10) Real algebraic sets (14P05)

Related Items (4)

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ SONC optimization and exact nonnegativity certificates via second-order cone programming ⋮ Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares

This page was built for publication: Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials