Recognition: unknown
Iteration-Complexity of the Subgradient Method on Riemannian Manifolds with Lower Bounded Curvature
classification
🧮 math.OC
keywords
methodsubgradientboundedcurvatureiteration-complexitylowermanifoldsriemannian
read the original abstract
The subgradient method for convex optimization problems on complete Riemannian manifolds with lower bounded sectional curvature is analyzed in this paper. Iteration-complexity bounds of the subgradient method with exogenous step-size and Polyak's step-size are stablished, completing and improving recent results on the subject.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.