Spectral residual method for nonlinear equations on Riemannian manifolds

被引:0
作者
Harry Oviedo
Hugo Lara
机构
[1] Fundação Getulio Vargas (FGV/EMAp),Escola de Matemática Aplicada
[2] Universidade Federal de Santa Catarina,undefined
[3] Campus Blumenau,undefined
来源
Computational and Applied Mathematics | 2021年 / 40卷
关键词
Tangent vector field; Riemannian manifold; Nonlinear system of equations; Spectral residual method; Non-monotone line search; 65K05; 90C30; 90C56; 53C21;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, the spectral algorithm for nonlinear equations (SANE) is adapted to the problem of finding a zero of a given tangent vector field on a Riemannian manifold. The generalized version of SANE uses, in a systematic way, the tangent vector field as a search direction and a continuous real-valued function that adapts this direction and ensures that it verifies a descent condition for an associated merit function. To speed up the convergence of the proposed method, we incorporate a Riemannian adaptive spectral parameter in combination with a non-monotone globalization technique. The global convergence of the proposed procedure is established under some standard assumptions. Numerical results indicate that our algorithm is very effective and efficient solving tangent vector field on different Riemannian manifolds and competes favorably with a Polak–Ribiére–Polyak method recently published and other methods existing in the literature.
引用
收藏
相关论文
共 71 条
  • [1] Adler RL(2002)Newton’s method on Riemannian manifolds and a geometric model for the human spine IMA J Numer Anal 22 359-390
  • [2] Dedieu J-P(1988)Two-point step size gradient methods IMA J Numer Anal 8 141-148
  • [3] Margulies JY(2014)Manopt, a matlab toolbox for optimization on manifolds J Mach Learn Res 15 1455-1459
  • [4] Martens M(2018)Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number Appl Math Lett 78 42-50
  • [5] Shub M(2018)Projected nonmonotone search methods for optimization with orthogonality constraints Comput Appl Math 37 3118-3144
  • [6] Barzilai J(2011)The university of florida sparse matrix collection ACM Trans Math Softw (TOMS) 38 1-213
  • [7] Borwein JM(2002)Benchmarking optimization software with performance profiles Math Program 91 201-353
  • [8] Boumal N(1998)The geometry of algorithms with orthogonality constraints SIAM J Matrix Anal Appl 20 303-716
  • [9] Bamdev M(1986)A nonmonotone line search technique for newton’s method SIAM J Numer Anal 23 707-517
  • [10] Absil P-A(2018)The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation IMA J Numer Anal 38 495-419