An intrinsic Riemannian proximal gradient method is shown to converge sublinearly on geodesically convex problems and linearly on strongly convex problems over Hadamard manifolds.
Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
The Intrinsic Riemannian Proximal Gradient Method for Convex Optimization
An intrinsic Riemannian proximal gradient method is shown to converge sublinearly on geodesically convex problems and linearly on strongly convex problems over Hadamard manifolds.