Fetching the paper…
Reading the bibliography…
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.
Do symmetric problems have symmetric solutions?
W. C. Waterhouse · 1983
Earlier work this paper cites.
Forms derived from the arithmetic-geometric inequality
B. Reznick · 1989
Earlier work this paper cites.
Enumerative Combinatorics
R. P. Stanley · 1999
Earlier work this paper cites.
On the positivity of symmetric polynomial functions. Part I: General results
V. Timofte · 2003
Earlier work this paper cites.
Symmetry groups, semidefinite programs, and sums of squares
K. Gatermann and P. A. Parrilo · 2004
Earlier work this paper cites.
Convergent SDP-relaxations in polynomial optimization with sparsity
J. B. Lasserre · 2006
Earlier work this paper cites.
Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity
H. Waki, S. Kim, M. Kojima, and M. Muramatsu · 2006
Earlier work this paper cites.
New upper bounds for kissing numbers from semidefinite programming
C. Bachoc and F. Vallentin · 2008
Earlier work this paper cites.
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
E. de Klerk and R. Sotirov · 2010
Earlier work this paper cites.
Invariant semidefinite programs
C. Bachoc, D. C. Gijswijt, A. Schrijver, and F. Vallentin · 2012
Earlier work this paper cites.
Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
C. Pantea, H. Koeppl, and G. Craciun · 2012
Earlier work this paper cites.
On the degree and half-degree principle for symmetric polynomials
C. Riener · 2012
Earlier work this paper cites.
Exploiting symmetries in SDP-relaxations for polynomial optimization
C. Riener, T. Theobald, L. Jansson-Andrén, and J. B. Lasserre · 2013
Earlier work this paper cites.
Exploiting symmetry in copositive programs via semidefinite hierarchies
C. Dobre and J. Vera · 2015
Earlier work this paper cites.
Relative entropy relaxations for signomial optimization
V. Chandrasekaran and P. Shah · 2016
Cited alongside, same era.
Amoebas, nonnegative polynomials and sums of squares supported on circuits
S. Iliman and T. de Wolff · 2016
Cited alongside, same era.
Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
S. Iliman and T. de Wolff · 2016
Cited alongside, same era.
Relative entropy optimization and its applications
V. Chandrasekaran and P. Shah · 2017
Cited alongside, same era.
The REPOP toolbox: Tackling polynomial optimization using relative entropy relaxations
O. Karaca, G. Darivianakis, P. Beuchat, A. Georghiou, and J. Lygeros · 2017
Cited alongside, same era.
Reflection groups, reflection arrangements, and invariant real varieties
T. Friedl, C. Riener, and R. Sanyal · 2018
A second order cone characterization for sums of nonnegative circuits
J. Wang and V. Magron · 2020
Later among the works it cites.
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization
J. Wang, V. Magron, J. B. Lasserre, N. H. A. Mai · 2020
Later among the works it cites.
Multivariate interpolation: Preserving and exploiting symmetry
E. R. Bazan and E. Hubert · 2021
Closest in time.
Symmetric non-negative forms and sums of squares
G. Blekherman and C. Riener · 2021
Closest in time.
Algebraic perspectives on signomial optimization
M. Dressler and R. Murray · 2021
Closest in time.
Symmetry adapted Gram spectrahedra
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Symmetric sums of squares over k k -subset hypercubes
A. Raymond, J. Saunderson, M. Singh, and R. R. Thomas · 2018
Cited alongside, same era.
An experimental comparison of SONC and SOS certificates for unconstrained optimization
H. Seidler and T. de Wolff · 2018
Cited alongside, same era.
Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
G. Averkov · 2019
Cited alongside, same era.
An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
M. Dressler, S. Iliman, and T. de Wolff · 2019
Cited alongside, same era.
Simple graph density inequalities with no sum of squares proofs
G. Blekherman, A. Raymond, M. Singh, and R. Thomas · 2020
Cited alongside, same era.
Reflection groups and cones of sums of squares
S. Debus and C. Riener · 2020
Cited alongside, same era.
A. Heaton, S. Hoşten, and I. Shankar · 2021
Closest in time.
A unified framework of SAGE and SONC polynomials and its duality theory
L. Katthän, H. Naumann, and T. Theobald · 2021
Closest in time.
Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations
P. Moustrou, C. Riener, and H. Verdure · 2021
Closest in time.
Newton polytopes and relative entropy optimization
R. Murray, V. Chandrasekaran, and A. Wierman · 2021
Closest in time.
Signomial and polynomial optimization via relative entropy and partial dualization
R. Murray, V. Chandrasekaran, and A. Wierman · 2021
Closest in time.
The 𝒮 \mathcal{S} -cone and a primal-dual view on second-order representability
H. Naumann and T. Theobald · 2021
Closest in time.
Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
J. Wang, V. Magron, and J. B. Lasserre · 2021
Closest in time.
TSSOS: a moment-SOS hierarchy that exploits term sparsity
J. Wang, V. Magron, and J. B. Lasserre · 2021
Closest in time.