Doubling the dimension yields a benign landscape for the squared-stress

Abstract

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.

arXiv comment38 pages