A Riemannian Dimension-reduced Second Order Method with Application in Sensor Network Localization
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a cubic-regularized Riemannian optimization method (RDRSOM), which partially exploits the second order information and achieves the iteration complexity of O(1/ε3/2). In order to reduce the per-iteration computational cost, we further propose a practical version of (RDRSOM), which is an extension of the well known Barzilai-Borwein method and achieves the iteration complexity of O(1/ε3/2). We apply our method to solve a nonlinear formulation of the wireless sensor network localization problem whose feasible set is a Riemannian manifold that has not been considered in the literature before. Numerical experiments are conducted to verify the high efficiency of our algorithm compared to state-of-the-art Riemannian optimization methods and other nonlinear solvers.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Apr 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.
- 2024Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guaranteescited by 4
- 2025Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descentcited by 1
- 2025Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustnesscited by 0
- 2025Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness31 Jul 2025
- 2025Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent28 Apr 2025
- 2024Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees8 Oct 2024