Path-based incremental target level algorithm on Riemannian manifolds
From MaRDI portal
Publication:5221271
Recommendations
- An incremental subgradient method on Riemannian manifolds
- Incremental quasi-subgradient method for minimizing sum of geodesic quasi-convex functions on Riemannian manifolds with applications
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass
- Gradient method for optimization on Riemannian manifolds with lower bounded curvature
Cites work
- scientific article; zbMATH DE number 52737 (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?)
- A Distributed Newton Method for Network Utility Maximization—Part II: Convergence
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- A direct splitting method for nonsmooth variational inequalities
- A subgradient method for multiobjective optimization on Riemannian manifolds
- An incremental subgradient method on Riemannian manifolds
- Asynchronous Incremental Stochastic Dual Descent Algorithm for Network Resource Allocation
- Concepts and techniques of optimization on the sphere
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence of a simple subgradient level method
- Convergence rate of incremental subgradient algorithms
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- Decomposition into functions in the minimization problem
- Equilibrium problems in Hadamard manifolds
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Incremental proximal methods for large scale convex optimization
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Incremental subgradient methods for nondifferentiable optimization
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- Linear convergence of subgradient algorithm for convex feasibility on Riemannian manifolds
- On the convergence of gradient descent for finding the Riemannian center of mass
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Proximal subgradient and a characterization of Lipschitz function on Riemannian manifolds
- Subgradient algorithm on Riemannian manifolds
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- Subgradient method for convex feasibility on Riemannian manifolds
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Weak sharp minima on Riemannian manifolds
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
Cited in
(3)
This page was built for publication: Path-based incremental target level algorithm on Riemannian manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221271)
