Global rates of convergence for nonconvex optimization on manifolds
From MaRDI portal
Publication:5113326
DOI10.1093/IMANUM/DRX080zbMath1483.65092arXiv1605.08101OpenAlexW2402588523MaRDI QIDQ5113326
Nicolas Boumal, Pierre-Antoine Absil, Coralia Cartis
Publication date: 4 June 2020
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.08101
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (50)
Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery ⋮ On the optimization landscape of tensor decompositions ⋮ Riemannian proximal gradient methods ⋮ Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization ⋮ Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds ⋮ A Riemannian optimization approach to the radial distribution network load flow problem ⋮ Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy ⋮ An accelerated first-order method for non-convex optimization on manifolds ⋮ An alternative to EM for Gaussian mixture models: batch and stochastic Riemannian optimization ⋮ Cholesky QR-based retraction on the generalized Stiefel manifold ⋮ Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space ⋮ Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ Multivariate expectile-based distribution: properties, Bayesian inference, and applications ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds ⋮ Faster Riemannian Newton-type optimization by subsampling and cubic regularization ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ An exact penalty approach for optimization with nonnegative orthogonality constraints ⋮ Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization ⋮ An adaptive Riemannian gradient method without function evaluations ⋮ A Riemannian Proximal Newton Method ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ An inexact Riemannian proximal gradient method ⋮ Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms ⋮ A brief introduction to manifold optimization ⋮ Unnamed Item ⋮ Geometric Methods on Low-Rank Matrix and Tensor Manifolds ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Recent Advances in Stochastic Riemannian Optimization ⋮ Mini-workshop: Computational optimization on manifolds. Abstracts from the mini-workshop held November 15--21, 2020 (online meeting) ⋮ On the quality of first-order approximation of functions with Hölder continuous gradient ⋮ Memory-Efficient Structured Convex Optimization via Extreme Point Sampling ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ Simple algorithms for optimization on Riemannian manifolds with constraints ⋮ Riemannian gradient descent methods for graph-regularized matrix completion ⋮ Adaptive regularization with cubics on manifolds ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Quotient Geometry with Simple Geodesics for the Manifold of Fixed-Rank Positive-Semidefinite Matrices ⋮ Rank Optimality for the Burer--Monteiro Factorization ⋮ Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints ⋮ Nonconvex Phase Synchronization ⋮ A Riemannian rank-adaptive method for low-rank matrix completion ⋮ Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature ⋮ Riemannian Optimization on the Symplectic Stiefel Manifold ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ Non-convex exact community recovery in stochastic block model ⋮ New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition ⋮ Nonlinear matrix recovery using optimization on the Grassmann manifold ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint ⋮ Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
This page was built for publication: Global rates of convergence for nonconvex optimization on manifolds
