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.
@article{arxiv.1808.06274,
title = {Iteration-Complexity of the Subgradient Method on Riemannian Manifolds with Lower Bounded Curvature},
author = {O. P. Ferreira and M. S. Louzeiro and L. F. Prudente},
journal= {arXiv preprint arXiv:1808.06274},
year = {2018}
}