Symmetry reduction in AM/GM-based optimization
From MaRDI portal
(Redirected from Symmetry reduction in AM/GM-based optimization)
Abstract: The arithmetic mean/geometric mean-inequality (AM/GM-inequality) facilitates classes of non-negativity certificates and of relaxation techniques for polynomials and, more generally, for exponential sums. Here, we present a first systematic study of the AM/GM-based techniques in the presence of symmetries under the linear action of a finite group. We prove a symmetry-adapted representation theorem and develop techniques to reduce the size of the resulting relative entropy programs. We study in more detail the complexity gain in the case of the symmetric group. In this setup, we can show in particular certain stabilization results. We exhibit several sequences of examples in growing dimensions where the size of the problem stabilizes. Finally, we provide some numerical results, emphasizing the computational speed-up.
Recommendations
Cites work
- A second order cone characterization for sums of nonnegative circuits
- A unified framework of SAGE and SONC polynomials and its duality theory
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Do Symmetric Problems Have Symmetric Solutions?
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Forms derived from the arithmetic-geometric inequality
- Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
- Global optimization via the dual SONC cone and linear programming
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- Invariant Semidefinite Programs
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Multivariate interpolation: preserving and exploiting symmetry
- New upper bounds for kissing numbers from semidefinite programming
- Newton polytopes and relative entropy optimization
- On the degree and half-degree principle for symmetric polynomials
- On the positivity of symmetric polynomial functions. I: General results
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Reflection groups, reflection arrangements, and invariant real varieties
- Relative entropy optimization and its applications
- Relative entropy relaxations for signomial optimization
- Signomial and polynomial optimization via relative entropy and partial dualization
- Simple graph density inequalities with no sum of squares proofs
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations
- Symmetric non-negative forms and sums of squares
- Symmetric sums of squares over \(k\)-subset hypercubes
- Symmetry adapted Gram spectrahedra
- Symmetry groups, semidefinite programs, and sums of squares
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Cited in
(6)- Algebraic Perspectives on Signomial Optimization
- Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023
- The poset of Specht ideals for hyperoctahedral groups
- Symmetric SAGE and SONC forms, exactness and quantitative gaps
- Symmetries in polynomial optimization
- Relative entropy methods in constrained polynomial and signomial optimization
This page was built for publication: Symmetry reduction in AM/GM-based optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080501)
