Metraipolis › archive › dc_83b13f064bb2
The AHI family of sum of squares polynomials — arXiv:2608.28015
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.28015
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T11:17:51.031Z
- SHA-256 of the archived text
d5e4bd11fc48ee87a0b5af81daa246b23470a9aba48ef0bc11e83db43e2c8ddd- Stable URL of this page
https://metraipolis.com/documento/dc_83b13f064bb2
How to cite
The AHI family of sum of squares polynomials — arXiv:2608.28015 — arXiv (en), https://arxiv.org/abs/2608.28015 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_83b13f064bb2 (Metraipolis archive dc_83b13f064bb2, sha256 d5e4bd11fc48ee87a0b5af81daa246b23470a9aba48ef0bc11e83db43e2c8ddd)
BibTeX
@misc{dc83b13f064bb2,
title = {The AHI family of sum of squares polynomials — arXiv:2608.28015},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.28015},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_83b13f064bb2; sha256 d5e4bd11fc48ee87a0b5af81daa246b23470a9aba48ef0bc11e83db43e2c8ddd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28015. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a new family of non-negative polynomials, constructed via the arithmetic harmonic inequality, called AHI polynomials. We derive explicit algebraic conditions for this family and prove that, for AHI polynomials, the cone of non-negative polynomials coincides with the cone of sum of squares (SOS) polynomials. We then study their convexity, showing that although AHI polynomials are generally nonconvex, certain monomial substructures are SOS convex. We further locate the family precisely among the standard nonnegativities certificates; every AHI polynomial is simultaneously SOS and a sum of non negative circuit polynomials (SONC), and the containment in the intersection of these two cones is strict. By closing this family under multiplication, we obtain a cone Pi AHI that is, by construction, still SOS, yet we prove that it lies outside both the SONC cone and the smaller SDSOS cone. Moreover, membership in this cone admits a closed form certificate that does not require solving any semidefinite programs. Finally, we demonstrate the usefulness of these structures in optimization, numerical experiments indicate that exploiting AHI sparsity yields a computation time over 300 times faster than dense SOS relaxations and enables solving high degree polynomial optimization problems (up to degree 40) that standard methods cannot handle due to computational limits, and a factorized hierarchy for Pi AHI decomposes products into independent small subproblems that generic sparsity techniques do not detect. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.28015 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T10:58:16.479Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).