A second order cone characterization for sums of nonnegative circuits
From MaRDI portal
Publication:5146008
DOI10.1145/3373207.3404033OpenAlexW3004605460MaRDI QIDQ5146008
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/1906.06179
second-order cone programmingpolynomial optimizationsum of nonnegative circuit polynomialssecond-order cone representationsum of binomial squares
Related Items
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients, Sublinear circuits for polyhedral sets, Nonnegative Polynomials and Circuit Polynomials, Symmetry Reduction in AM/GM-Based Optimization, SONC optimization and exact nonnegativity certificates via second-order cone programming, A hierarchy of spectral relaxations for polynomial optimization, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, Sublinear circuits and the constrained signomial nonnegativity problem, A unified framework of SAGE and SONC polynomials and its duality theory
Uses Software
