Path-based incremental target level algorithm on Riemannian manifolds

DOI10.1080/02331934.2019.1671840zbMATH Open1433.90119OpenAlexW2977284870WikidataQ115301384 ScholiaQ115301384MaRDI QIDQ5221271FDOQ5221271

Authors:

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

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

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)

Cites Work

• Title not available (Why is that?)
• Convergence rate of incremental subgradient algorithms
• Title not available (Why is that?)
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
• Subgradient algorithm on Riemannian manifolds
• \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
• On the convergence of gradient descent for finding the Riemannian center of mass
• Weak sharp minima on Riemannian manifolds
• Subgradient method for convex feasibility on Riemannian manifolds
• Title not available (Why is that?)
• Equilibrium problems in Hadamard manifolds
• Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• A subgradient method for multiobjective optimization on Riemannian manifolds
• Decomposition into functions in the minimization problem
• Incremental subgradient methods for nondifferentiable optimization
• Concepts and techniques of optimization on the sphere
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Convergence of a simple subgradient level method
• Incremental proximal methods for large scale convex optimization
• A direct splitting method for nonsmooth variational inequalities
• Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
• Proximal subgradient and a characterization of Lipschitz function on Riemannian manifolds
• Incremental stochastic subgradient algorithms for convex optimization
• Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
• Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
• Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
• An incremental subgradient method on Riemannian manifolds
• Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
• Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
• A Distributed Newton Method for Network Utility Maximization—Part II: Convergence
• Asynchronous Incremental Stochastic Dual Descent Algorithm for Network Resource Allocation

Cited In (1)

• Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications

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)