Metraipolis › archive › dc_2898bb95b42e

A bounded degree SDSOS hierarchy for solving SPLD polynomial programs — arXiv:2610.41483

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.41483
License (as archived): CC0-1.0
Archived: 2026-11-02T07:57:44.202Z
SHA-256 of the archived text: c851a228107d2901337c7aa49eba354b4669e4533ebed5ec49b6617c79da88f6
Stable URL of this page: https://metraipolis.com/documento/dc_2898bb95b42e

How to cite

A bounded degree SDSOS hierarchy for solving SPLD polynomial programs — arXiv:2610.41483 — arXiv (en), https://arxiv.org/abs/2610.41483 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2898bb95b42e (Metraipolis archive dc_2898bb95b42e, sha256 c851a228107d2901337c7aa49eba354b4669e4533ebed5ec49b6617c79da88f6)

BibTeX

@misc{dc2898bb95b42e,
  title = {A bounded degree SDSOS hierarchy for solving SPLD polynomial programs — arXiv:2610.41483},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41483},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2898bb95b42e; sha256 c851a228107d2901337c7aa49eba354b4669e4533ebed5ec49b6617c79da88f6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41483. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A polynomial optimization problem is said to have an SPLD structure if the polynomials defining its objective and constraints admit decompositions into separable and nonseparable parts, with the maximum degree of the separable parts exceeding that of the nonseparable parts. In this paper, we propose a bounded degree SDSOS hierarchy for globally solving a class of such problems. We establish the asymptotic convergence of this hierarchy over compact feasible sets and provide a sufficient condition for its finite convergence. Numerical experiments compare the proposed hierarchy with the BSDSOS hierarchy (Chuong et al. in J. Global Optim., 75(4):885-919, 2019).

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.41483 — 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-11-02T07:41:45.706Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).