Subgradient Algorithm on Riemannian Manifolds

被引:0
|
作者
O. P. Ferreira
P. R. Oliveira
机构
[1] Universidade Federal de Goiás,Instituto de Matemática e Estatistica
[2] Universidade Federal do Rio de Janeiro,Programa de Engenharia de Sistemas e Computação, COPPE
关键词
Nondifferentiable optimization; convex programming; subgradient methods; Riemannian manifolds;
D O I
暂无
中图分类号
学科分类号
摘要
The subgradient method is generalized to the context of Riemannian manifolds. The motivation can be seen in non-Euclidean metrics that occur in interior-point methods. In that frame, the natural curves for local steps are the geodesies relative to the specific Riemannian manifold. In this paper, the influence of the sectional curvature of the manifold on the convergence of the method is discussed, as well as the proof of convergence if the sectional curvature is nonnegative.
引用
收藏
页码:93 / 104
页数:11
相关论文
共 50 条