Metraipolis › archive › dc_ffd1e3edbb7e
Doubling the dimension yields a benign landscape for the squared-stress — arXiv:2608.16799
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16799
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T20:19:12.958Z
- SHA-256 of the archived text
134904bcb244079411100ac6dc9dda6a1007e322a40d2cf7e1a683b3bdcd206d- Stable URL of this page
https://metraipolis.com/documento/dc_ffd1e3edbb7e
How to cite
Doubling the dimension yields a benign landscape for the squared-stress — arXiv:2608.16799 — arXiv (en), https://arxiv.org/abs/2608.16799 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ffd1e3edbb7e (Metraipolis archive dc_ffd1e3edbb7e, sha256 134904bcb244079411100ac6dc9dda6a1007e322a40d2cf7e1a683b3bdcd206d)
BibTeX
@misc{dcffd1e3edbb7e,
title = {Doubling the dimension yields a benign landscape for the squared-stress — arXiv:2608.16799},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16799},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ffd1e3edbb7e; sha256 134904bcb244079411100ac6dc9dda6a1007e322a40d2cf7e1a683b3bdcd206d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16799. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider the Euclidean distance geometry problem (EDG): given a subset of the pairwise distances of an unknown cloud of $n$ points in $\mathbb{R}^\ell$, recover the point cloud up to rigid motions. When $n$ is large, a popular practical approach is to minimize a nonconvex quartic, known as the squared-stress or s-stress, over point clouds in $\mathbb{R}^k$, with $k$ potentially larger than $\ell$. It is a long-standing open problem to understand the optimization landscape of the s-stress when all pairwise distances are known (Malone and Trosset, 2000; Parhizkar, 2013). It was recently shown that the landscape is not benign when $k=\ell$, and it was conjectured that the landscape becomes benign as soon as $k\ge \ell+1$ (Song et al., 2025; Criscitiello et al., 2026). Here, we show that the complete-graph s-stress has a benign landscape whenever $k\ge 2(\ell+1)$, establishing the conjecture up to a factor of two. A key idea is to view second-order criticality as a containment of two ellipsoids; finding a descent direction then corresponds to finding a separating hyperplane that violates this containment. This dual perspective yields the stated landscape result, and also applies to any measurement operator whose inverse satisfies a simple frame condition.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2608.16799 — 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-18T19:45:07.857Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).