An incremental subgradient method on Riemannian manifolds
From MaRDI portal
Publication:1752648
DOI10.1007/S10957-018-1224-6zbMath1391.90485OpenAlexW2790036633WikidataQ115382553 ScholiaQ115382553MaRDI QIDQ1752648
Publication date: 24 May 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1224-6
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of reduced gradient type (90C52)
Related Items (3)
First Order Methods for Optimization on Riemannian Manifolds ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- Monotone and accretive vector fields on Riemannian manifolds
- Convergence of Newton's method for sections on Riemannian manifolds
- Pegasos: primal estimated sub-gradient solver for SVM
- Equilibrium problems in Hadamard manifolds
- Proximal subgradient and a characterization of Lipschitz function on Riemannian manifolds
- Semivectorial bilevel optimization on Riemannian manifolds
- Geodesic convexity in nonlinear optimization
- Newton's method for sections on Riemannian manifolds: Generalized covariant \(\alpha \)-theory
- Local convexity on smooth manifolds
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Decomposition into functions in the minimization problem
- Subgradient algorithm on Riemannian manifolds
- Error stability properties of generalized gradient-type algorithms
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- The incremental subgradient methods on distributed estimations in-network
- Extended Newton's method for mappings on Riemannian manifolds with values in a cone
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Weak Sharp Minima on Riemannian Manifolds
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- A New Class of Incremental Gradient Methods for Least Squares Problems
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Gradient Convergence in Gradient methods with Errors
This page was built for publication: An incremental subgradient method on Riemannian manifolds