{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:34:46Z","timestamp":1787340886436,"version":"build-2736575974"},"reference-count":41,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100016190","name":"Trond Mohn Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100016190","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007465","name":"Universitetet i Troms\u00f8","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007465","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:p>The arithmetic mean\/geometric mean inequality (AM\/GM inequality) facilitates classes of nonnegativity 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 reduced problem stabilizes. Finally, we provide some numerical results, emphasizing the computational speedup.<\/jats:p>","DOI":"10.1137\/21m1405691","type":"journal-article","created":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T10:35:21Z","timestamp":1651487721000},"page":"765-785","source":"Crossref","is-referenced-by-count":8,"title":["Symmetry Reduction in AM\/GM-Based Optimization"],"prefix":"10.1137","volume":"32","author":[{"given":"Philippe","family":"Moustrou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Helen","family":"Naumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1192-3500","authenticated-orcid":true,"given":"Cordian","family":"Riener","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5769-0917","authenticated-orcid":true,"given":"Thorsten","family":"Theobald","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugues","family":"Verdure","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2022,5,2]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1201342"},{"key":"atypb2","first-page":"219","volume":"2012","author":"Bachoc C.","journal-title":"Barlin"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-07-00589-9"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2021.01.004"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-019-4124-y"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-020-00208-w"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/140988978"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-0998-2"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0246-5"},{"key":"atypb10","unstructured":"S. Debus and C. Riener,\n                      Reflection Groups and Cones of Sums of Squares\n                      , preprint, arXiv:2011.09997, 2020."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0879-0"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"M. Dressler, J. Heuer, H. Naumann, and T. de Wolff,\n                      Global optimization via the dual SONC cone and linear programming\n                      , Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, 2020, pp. 138-145.","DOI":"10.1145\/3373207.3404043"},{"key":"atypb13","unstructured":"M. Dressler and R. Murray,\n                      Algebraic Perspectives on Signomial Optimization\n                      , preprint, arXiv:2107.00345, 2021."},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2018.06.018"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1090\/proc\/13821"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2003.12.011"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/20M133796X"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1186\/s40687-016-0052-2"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/140962425"},{"key":"atypb20","doi-asserted-by":"crossref","unstructured":"O. Karaca, G. Darivianakis, P. Beuchat, A. Georghiou, and J. Lygeros,\n                      The REPOP Toolbox: Tackling Polynomial Optimization Using Relative Entropy Relaxations\n                      , 20th IFAC World Congress, IFAC PapersOnLine, Vol. 50, 2017, Elsevier, Amsterdam, pp. 11652-11657.","DOI":"10.1016\/j.ifacol.2017.08.1669"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3607"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1137\/05064504X"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2021.02.002"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-021-09497-w"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00193-4"},{"key":"atypb26","doi-asserted-by":"crossref","unstructured":"R. Murray, H. Naumann, and T. Theobald,\n                      Sublinear circuits and the constrained signomial optimization problem\n                      , Math. Program. Ser. A, (2022),https:\/\/doi.org\/10.1007\/s10107-022-01776-w.","DOI":"10.1007\/s10107-022-01776-w"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1007\/s13366-020-00512-9"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.3934\/dcdsb.2012.17.2153"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1127-6"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442738"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2011.08.012"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0558"},{"key":"atypb33","unstructured":"H. Seidler and T. de Wolff,\n                      An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization\n                      , preprint, arXiv:1808.08431,https:\/\/www3.math.tu-berlin.de\/combi\/RAAGConOpt\/comparison_paper, 2018."},{"key":"atypb34","doi-asserted-by":"crossref","unstructured":"R. P. Stanley,\n                      Enumerative Combinatorics\n                      , Vol. 2, Cambridge University Press, Cambridge, 1999.","DOI":"10.1017\/CBO9780511609589"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-247X(03)00301-9"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1137\/050623802"},{"key":"atypb37","doi-asserted-by":"crossref","unstructured":"J. Wang and V. Magron,\n                      A second order cone characterization for sums of nonnegative circuits\n                      , Proceeding of the 45th International Symposium on Symbolic and Algebraic Computation, 2020, pp. 450-457.","DOI":"10.1145\/3373207.3404033"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323564"},{"key":"atypb39","first-page":"1","volume":"31","author":"Wang J.","year":"2021","journal-title":"SIAM J. Optim."},{"key":"atypb40","unstructured":"J. Wang, V. Magron, J. B. Lasserre, and N. H. A. Mai,\n                      CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization\n                      , preprint, arXiv:2005.02828, 2020."},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1983.11971235"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/21M1405691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:54:53Z","timestamp":1787338493000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1405691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10.1137\/21M1405691"],"URL":"https:\/\/doi.org\/10.1137\/21m1405691","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,2]]}}}