Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
From MaRDI portal
Publication:2260660
DOI10.1007/s10957-014-0568-9zbMath1308.90131OpenAlexW2015965973WikidataQ115382567 ScholiaQ115382567MaRDI QIDQ2260660
Chong Li, Jen-Chih Yao, Xiangmei Wang
Publication date: 11 March 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0568-9
Riemannian manifoldsectional curvatureconvex feasibility problemcyclic subgradient projection algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Convexity and some geometric properties ⋮ Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds ⋮ Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases ⋮ A modified Riemannian Halpern algorithm for nonexpansive mappings on Hadamard manifolds ⋮ Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds ⋮ Strong convergence of alternating projections ⋮ Proximal point method for vector optimization on Hadamard manifolds ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ A Riemannian Inertial Mann Algorithm for Nonexpansive Mappings on Hadamard Manifolds ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Iterative Method with Inertia for Variational Inequalities on Hadamard Manifolds with Lower Bounded Curvature ⋮ Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass ⋮ Subgradient algorithms on Riemannian manifolds of lower bounded curvatures ⋮ An incremental subgradient method on Riemannian manifolds ⋮ Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgradient method for convex feasibility on Riemannian manifolds
- Singularities of monotone vector fields and an extragradient-type algorithm
- Monotone and accretive vector fields on Riemannian manifolds
- Newton's method for sections on Riemannian manifolds: Generalized covariant \(\alpha \)-theory
- Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
- A parallel subgradient projections method for the convex feasibility problem
- Minimizing a differentiable function over a differential manifold
- Subgradient algorithm on Riemannian manifolds
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Trust-region methods on Riemannian manifolds
- Extended Newton's method for mappings on Riemannian manifolds with values in a cone
- Extrapolation algorithm for affine-convex feasibility problems
- The constrained Newton method on a Lie group and the symmetric eigenvalue problem
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
- Variational Inequalities for Set-Valued Vector Fields on Riemannian Manifolds: Convexity of the Solution Set and the Proximal Point Algorithm
- Newton's method on Riemannian manifolds and a geometric model for the human spine
- Weak Sharp Minima on Riemannian Manifolds
- On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
- Monotone vector fields and the proximal point algorithm on Hadamard manifolds
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Proximal Point Algorithm On Riemannian Manifolds
- On Projection Algorithms for Solving Convex Feasibility Problems
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- The Gradient Projection Method Along Geodesics
- Optimal stability and eigenvalue multiplicity