Symmetric SAGE and SONC forms, exactness and quantitative gaps
From MaRDI portal
Publication:6615415
DOI10.1016/J.JSC.2024.102374MaRDI QIDQ6615415
Thorsten Theobald, Hugues Verdure, Philippe Moustrou, Cordian Riener
Publication date: 8 October 2024
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
symmetric polynomialsMuirhead's inequalitysums of nonnegative circuit polynomialssums of arithmetic-geometric exponentialsnonnegativity certificates
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- Signomial and polynomial optimization via relative entropy and partial dualization
- Forms derived from the arithmetic-geometric inequality
- Recent extensions of \textit{Descartes}' rule of signs.
- On the comparison of the arithmetic and geometric means.
- Majorization and the Lorenz order with applications in applied mathematics and economics
- Symmetry groups, semidefinite programs, and sums of squares
- Real zeros of SONC polynomials
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability
- An SOS counterexample to an inequality of symmetric functions
- Multivariate interpolation: preserving and exploiting symmetry
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations
- Newton polytopes and relative entropy optimization
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- Symmetric non-negative forms and sums of squares
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Sublinear circuits and the constrained signomial nonnegativity problem
- Invariant Semidefinite Programs
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Relative entropy relaxations for signomial optimization
- Symmetric interpolation, Exchange Lemma and Sylvester sums
- The Algebraic Boundary of the Sonc-Cone
- Nonnegative Polynomials and Circuit Polynomials
- Symmetry Reduction in AM/GM-Based Optimization
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
- A unified framework of SAGE and SONC polynomials and its duality theory
- Algebraic Perspectives on Signomial Optimization
- Inequalities: theory of majorization and its applications
- Inequalities for symmetric means
This page was built for publication: Symmetric SAGE and SONC forms, exactness and quantitative gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615415)