Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
From MaRDI portal
Publication:2363571
Abstract: This paper considers optimization problems on Riemannian manifolds and analyzes iteration-complexity for gradient and subgradient methods on manifolds with non-negative curvature. By using tools from the Riemannian convex analysis and exploring directly the tangent space of the manifold, we obtain different iteration-complexity bounds for the aforementioned methods, complementing and improving related results. Moreover, we also establish iteration-complexity bound for the proximal point method on Hadamard manifolds.
Recommendations
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- First order methods for optimization on Riemannian manifolds
- Subgradient algorithm on Riemannian manifolds
- Gradient method for optimization on Riemannian manifolds with lower bounded curvature
- The study of the subgradient algorithm and its convergence on Riemannian manifolds
Cites work
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 1282147 (Why is no real title available?)
- scientific article; zbMATH DE number 681023 (Why is no real title available?)
- scientific article; zbMATH DE number 909255 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- A proximal point algorithm for DC functions on Hadamard manifolds
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of subgradient algorithm for convex feasibility on Riemannian manifolds
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Minimizing a differentiable function over a differential manifold
- Monotone Operators and the Proximal Point Algorithm
- Monotone vector fields and the proximal point algorithm on Hadamard manifolds
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- Optimization Techniques on Riemannian Manifolds
- Proximal Point Algorithm On Riemannian Manifolds
- Proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- Subgradient algorithm on Riemannian manifolds
- Subgradient method for convex feasibility on Riemannian manifolds
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- The Geometry of Algorithms with Orthogonality Constraints
- The Gradient Projection Method Along Geodesics
- The proximal point algorithm in metric spaces
- Weak sharp minima on Riemannian manifolds
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
Cited in
(35)- Riemannian optimization via Frank-Wolfe methods
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
- A brief introduction to manifold optimization
- First order methods for optimization on Riemannian manifolds
- The study of the subgradient algorithm and its convergence on Riemannian manifolds
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- Adaptive regularization with cubics on manifolds
- A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Riemannian proximal gradient methods
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- A projection algorithm for pseudomonotone vector fields with convex constraints on Hadamard manifolds
- Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds
- A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems
- An accelerated first-order method for non-convex optimization on manifolds
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Path-based incremental target level algorithm on Riemannian manifolds
- Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Stochastic proximal gradient method FOR \(\ell_1\) regularized optimization over a sphere
- A modified proximal point method for DC functions on Hadamard manifolds
- Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
- Traub-type high order iterative procedures on Riemannian manifolds
- Simple algorithms for optimization on Riemannian manifolds with constraints
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Proximal Point Algorithm On Riemannian Manifolds
- scientific article; zbMATH DE number 5244807 (Why is no real title available?)
- Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
- Gradient method for optimization on Riemannian manifolds with lower bounded curvature
- Proximal gradient algorithm with trust region scheme on Riemannian manifold
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Iterative Method with Inertia for Variational Inequalities on Hadamard Manifolds with Lower Bounded Curvature
- An adaptive Riemannian gradient method without function evaluations
This page was built for publication: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363571)
