Path-based incremental target level algorithm on Riemannian manifolds

DOI10.1080/02331934.2019.1671840zbMath1433.90119OpenAlexW2977284870WikidataQ115301384 ScholiaQ115301384MaRDI QIDQ5221271

No author found.

Publication date: 25 March 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2019.1671840

zbMATH Keywords

Riemannian manifoldsconvex programmingpath-based incremental target level algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of reduced gradient type (90C52)

Related Items (1)

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
• \(\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
• A direct splitting method for nonsmooth variational inequalities
• Subgradient method for convex feasibility on Riemannian manifolds
• Incremental proximal methods for large scale convex optimization
• Equilibrium problems in Hadamard manifolds
• Proximal subgradient and a characterization of Lipschitz function on Riemannian manifolds
• Decomposition into functions in the minimization problem
• Subgradient algorithm on Riemannian manifolds
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Convergence of a simple subgradient level method
• An incremental subgradient method on Riemannian manifolds
• 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
• Incremental Subgradient Methods for Nondifferentiable Optimization
• Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
• On the Convergence of Gradient Descent for Finding the Riemannian Center of Mass
• Weak Sharp Minima on Riemannian Manifolds
• Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
• Incremental Stochastic Subgradient Algorithms for Convex Optimization
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• Asynchronous Incremental Stochastic Dual Descent Algorithm for Network Resource Allocation
• Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
• Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
• A Distributed Newton Method for Network Utility Maximization—Part II: Convergence

This page was built for publication: Path-based incremental target level algorithm on Riemannian manifolds