期刊
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
卷 173, 期 2, 页码 548-562出版社
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-017-1093-4
关键词
Complexity; Gradient method; Subgradient method; Proximal point method; Riemannian manifold
资金
- CNPq [458479/2014-4, 312077/2014-9, 305158/2014-7, 444134/2014-0, 406975/2016-7]
This paper considers optimization problems on Riemannian manifolds and analyzes the iteration-complexity for gradient and subgradient methods on manifolds with nonnegative curvatures. By using tools from Riemannian convex analysis and directly exploring the tangent space of the manifold, we obtain different iteration-complexity bounds for the aforementioned methods, thereby complementing and improving related results. Moreover, we also establish an iteration-complexity bound for the proximal point method on Hadamard manifolds.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据