Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
From MaRDI portal
Publication:4639125
DOI10.1080/02331934.2017.1387548zbMath1398.90125OpenAlexW2763690350WikidataQ115301394 ScholiaQ115301394MaRDI QIDQ4639125
No author found.
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1387548
convex optimizationRiemannian manifoldsectional curvaturesubgradient algorithmRiemannian \(L^p\) center of mass
Related Items (10)
Subgradient method with feasible inexact projections for constrained convex optimization problems ⋮ A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems ⋮ Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints ⋮ A new subspace minimization conjugate gradient method for unconstrained minimization ⋮ Subgradient algorithm for computing contraction metrics for equilibria ⋮ Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass ⋮ 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
- Primal-dual subgradient methods for convex problems
- Composite proximal bundle method
- Incremental proximal methods for large scale convex optimization
- Resolvents of set-valued monotone vector fields in Hadamard manifolds
- On the metric projection onto convex sets in riemannian spaces
- Subgradient algorithm on Riemannian manifolds
- Convergence of a simple subgradient level method
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- New variants of bundle methods
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- Convergence analysis of inexact proximal point algorithms on Hadamard manifolds
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Trust-region methods on Riemannian manifolds
- On the structure of complete manifolds of nonnegative curvature
- Incremental Subgradient Methods for Nondifferentiable Optimization
- On the Convergence of Gradient Descent for Finding the Riemannian Center of Mass
- Riemannian $L^{p}$ center of mass: Existence, uniqueness, and convexity
- 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
- Monotone vector fields and the proximal point algorithm on Hadamard manifolds
- A merit function approach to the subgradient method with averaging
- Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination
This page was built for publication: Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
