Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
From MaRDI portal
Publication:2363571
DOI10.1007/s10957-017-1093-4zbMath1400.90277arXiv1609.04869OpenAlexW2522924238WikidataQ115382559 ScholiaQ115382559MaRDI QIDQ2363571
Jefferson G. Melo, Orizon P. Ferreira, Glaydston C. Bento
Publication date: 20 July 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04869
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems ⋮ Riemannian proximal gradient methods ⋮ Riemannian optimization via Frank-Wolfe methods ⋮ An accelerated first-order method for non-convex optimization on manifolds ⋮ Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds ⋮ Proximal gradient algorithm with trust region scheme on Riemannian manifold ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ A projection algorithm for pseudomonotone vector fields with convex constraints on Hadamard manifolds ⋮ An adaptive Riemannian gradient method without function evaluations ⋮ Iterative Method with Inertia for Variational Inequalities on Hadamard Manifolds with Lower Bounded Curvature ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ A brief introduction to manifold optimization ⋮ Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature ⋮ Unnamed Item ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Simple algorithms for optimization on Riemannian manifolds with constraints ⋮ Adaptive regularization with cubics on manifolds ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature ⋮ Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ 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
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Subgradient method for convex feasibility on Riemannian manifolds
- A proximal point algorithm for DC functions on Hadamard 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
- Subgradient algorithm on Riemannian manifolds
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Introductory lectures on convex optimization. A basic course.
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- The proximal point algorithm in metric spaces
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- Weak Sharp Minima on Riemannian Manifolds
- Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
- Monotone vector fields and the proximal point algorithm on Hadamard manifolds
- Monotone Operators and the Proximal Point Algorithm
- The Geometry of Algorithms with Orthogonality Constraints
- Optimization Techniques on Riemannian Manifolds
- Proximal Point Algorithm On Riemannian Manifolds
- Proximal point method for a special class of nonconvex functions on Hadamard manifolds
- The Gradient Projection Method Along Geodesics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
