A second order cone characterization for sums of nonnegative circuits
From MaRDI portal
Recommendations
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability
- A Positivstellensatz for sums of nonnegative circuit polynomials
- Nonnegative Polynomials and Circuit Polynomials
- The dual cone of sums of non-negative circuit polynomials
Cited in
(15)- Sublinear circuits for polyhedral sets
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Sublinear circuits and the constrained signomial nonnegativity problem
- Nonnegative Polynomials and Circuit Polynomials
- Symmetry reduction in AM/GM-based optimization
- A unified framework of SAGE and SONC polynomials and its duality theory
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- A hierarchy of spectral relaxations for polynomial optimization
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- Weighted geometric mean, minimum mediated set, and optimal simple second-order cone representation
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Exploiting constant trace property in large-scale polynomial optimization
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Sparse polynomial matrix optimization
- Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
This page was built for publication: A second order cone characterization for sums of nonnegative circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146008)
