Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
From MaRDI portal
Publication:4631817
DOI10.1080/02331934.2018.1542532zbMath1421.90114arXiv1808.06274OpenAlexW2887923753WikidataQ115301392 ScholiaQ115301392MaRDI QIDQ4631817
L. F. Prudente, Maurício Silva Louzeiro, Orizon P. Ferreira
Publication date: 23 April 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.06274
Related Items
A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ Subgradient algorithm for computing contraction metrics for equilibria ⋮ Review on contraction analysis and computation of contraction metrics ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ A Subgradient Algorithm for Data-Rate Optimization in the Remote State Estimation Problem
Cites Work
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- Concepts and techniques of optimization on the sphere
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Subgradient method for convex feasibility on Riemannian manifolds
- Statistics on the manifold of multivariate normal distributions: theory and application to diffusion tensor MRI processing
- Subgradient algorithm on Riemannian manifolds
- Convergence of some algorithms for convex minimization
- Smooth nonlinear optimization of \(\mathbb R^n\)
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- Subgradient optimization in nonsmooth optimization (including the soviet revolution)
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- A framework for generalising the Newton method and other iterative methods from Euclidean space to manifolds
- Riemannian median and its estimation
- Variational Inequalities for Set-Valued Vector Fields on Riemannian Manifolds: Convexity of the Solution Set and the Proximal Point Algorithm
- Weak Sharp Minima on Riemannian Manifolds
- Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
- The Geometry of Algorithms with Orthogonality Constraints
- Optimization Techniques on Riemannian Manifolds
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- Full convergence of the steepest descent method with inexact line searches
- 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
