Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature. (3rd April 2019)
- Record Type:
- Journal Article
- Title:
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature. (3rd April 2019)
- Main Title:
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- Authors:
- Ferreira, O. P.
Louzeiro, M. S.
Prudente, L. F. - Abstract:
- Abstract: The subgradient method for convex optimization problems on complete Riemannian manifolds with lower bounded sectional curvature is analysed 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.
- Is Part Of:
- Optimization. Volume 68:Number 4(2019)
- Journal:
- Optimization
- Issue:
- Volume 68:Number 4(2019)
- Issue Display:
- Volume 68, Issue 4 (2019)
- Year:
- 2019
- Volume:
- 68
- Issue:
- 4
- Issue Sort Value:
- 2019-0068-0004-0000
- Page Start:
- 713
- Page End:
- 729
- Publication Date:
- 2019-04-03
- Subjects:
- Subgradient method -- Riemannian manifold -- complexity -- convex programming -- lower bounded curvature
Mathematical optimization -- Periodicals
519.7 - Journal URLs:
- http://www.tandfonline.com/toc/gopt20/current ↗
http://www.tandfonline.com/ ↗ - DOI:
- 10.1080/02331934.2018.1542532 ↗
- Languages:
- English
- ISSNs:
- 0233-1934
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 6275.100000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 9782.xml