Metraipolis › archive › dc_a44ee53d9428
Recognizing Signomial Convexity is Hard — arXiv:2610.01812
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01812
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:01:13.585Z
- SHA-256 of the archived text
f9307ed35fa09e184ba1c434b7c45bbc3f4827695eb47ed8a9ac5d9c4d678426- Stable URL of this page
https://metraipolis.com/documento/dc_a44ee53d9428
How to cite
Recognizing Signomial Convexity is Hard — arXiv:2610.01812 — arXiv (en), https://arxiv.org/abs/2610.01812 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a44ee53d9428 (Metraipolis archive dc_a44ee53d9428, sha256 f9307ed35fa09e184ba1c434b7c45bbc3f4827695eb47ed8a9ac5d9c4d678426)
BibTeX
@misc{dca44ee53d9428,
title = {Recognizing Signomial Convexity is Hard — arXiv:2610.01812},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01812},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a44ee53d9428; sha256 f9307ed35fa09e184ba1c434b7c45bbc3f4827695eb47ed8a9ac5d9c4d678426},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01812. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Signomials---finite sums of generalized monomials with real exponents---are a natural machine learning model, combining parsimonious representations of power laws, inverse relationships, and multiplicative interactions with universal approximation and interpretable parameters. In fact, 45 of the 100 equations in the AI Feynman benchmark admit signomial representations. Moreover, signomial optimization is widely used in engineering design, communications, economics, and machine learning, but is computationally intractable in general. Convexity, the gold standard for efficient optimization, offers three routes to tractability for signomials: a signomial may be convex in its original variables, become convex after a logarithmic change of variables, or, when positive, become convex after additionally taking the logarithm of its value---the structure underlying disciplined geometric programming. We show that recognizing each form is strongly NP-hard, both on compact domains and globally. Our proofs start from gap-promise variants of polynomial convexity and develop polynomial-to-signomial reductions that preserve curvature gaps under the relevant logarithmic transformations. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.01812 — 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-06T15:14:57.984Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).