A Riemannian dimension-reduced second-order method with application in sensor network localization

DOI10.1137/23M1567229zbMATH Open1548.90458MaRDI QIDQ6562381FDOQ6562381

Authors: Tianyun Tang, Kim-Chuan Toh, Nachuan Xiao, Yinyu Ye 

Publication date: 26 June 2024

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Recommendations

• Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization
• Adaptive quadratically regularized Newton method for Riemannian optimization
• Faster Riemannian Newton-type optimization by subsampling and cubic regularization
• A feasible method for sensor network localization
• Sequential quadratic optimization for nonlinear optimization problems on Riemannian manifolds

zbMATH Keywords

sensor network localizationRiemannian optimizationcubic regularization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cites Work

• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Manopt, a Matlab toolbox for optimization on manifolds
• QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
• Solving the Trust-Region Subproblem using the Lanczos Method
• Trust-region methods on Riemannian manifolds
• Title not available (Why is that?)
• Newton's method on Riemannian manifolds and a geometric model for the human spine
• On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
• The Molecule Problem: Exploiting Structure in Global Optimization
• Local minima and convergence in low-rank semidefinite programming
• A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
• A new, globally convergent Riemannian conjugate gradient method
• A Broyden class of quasi-Newton methods for Riemannian optimization
• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
• On solving trust-region and other regularised subproblems in optimization
• Cubic regularization of Newton method and its global performance
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• A Unified Theorem on SDP Rank Reduction
• A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
• Theory of semidefinite programming for sensor network localization
• Low-rank optimization on the cone of positive semidefinite matrices
• On the convergence of the self-consistent field iteration in Kohn-Sham density functional theory
• Elliptic preconditioner for accelerating the self-consistent field iteration in Kohn-Sham density functional theory
• Riemannian optimization for high-dimensional tensor completion
• Global rates of convergence for nonconvex optimization on manifolds
• Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
• Adaptive quadratically regularized Newton method for Riemannian optimization
• Robust low-rank matrix completion by Riemannian optimization
• Adaptive regularization with cubics on manifolds
• Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
• Computation of ground states of the Gross-Pitaevskii functional via Riemannian optimization
• An inertial Newton algorithm for deep learning
• Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
• Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy
• Solving graph equipartition SDPs on an algebraic variety
• A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem

This page was built for publication: A Riemannian dimension-reduced second-order method with application in sensor network localization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562381)