{
  "id": "1808.06274",
  "version": "v1",
  "published": "2018-08-20T00:18:24.000Z",
  "updated": "2018-08-20T00:18:24.000Z",
  "title": "Iteration-Complexity of the Subgradient Method on Riemannian Manifolds with Lower Bounded Curvature",
  "authors": [
    "O. P. Ferreira",
    "M. S. Louzeiro",
    "L. F. Prudente"
  ],
  "categories": [
    "math.OC"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-08-20T00:18:24.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "subgradient method",
      "lower bounded curvature",
      "convex optimization problems",
      "complete riemannian manifolds",
      "lower bounded sectional curvature"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}