An Optimal Extension of the Polak-Ribiere-Polyak Conjugate Gradient Method

被引:9
|
作者
Babaie-Kafaki, Saman [1 ]
Ghanbari, Reza [2 ]
机构
[1] Semnan Univ, Dept Math, Fac Math Stat & Comp Sci, POB 35195-363, Semnan, Iran
[2] Ferdowsi Univ Mashhad, Fac Math Sci, Mashhad, Iran
关键词
Conjugate gradient method; global convergence; large-scale optimization; singular value; unconstrained optimization; CONVERGENCE PROPERTIES; GLOBAL CONVERGENCE; DESCENT; ALGORITHM; PROPERTY;
D O I
10.1080/01630563.2017.1320673
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Based on a singular value analysis on an extension of the Polak-Ribiere-Polyak method, a nonlinear conjugate gradient method with the following two optimal features is proposed: the condition number of its search direction matrix is minimum and also, the distance of its search direction from the search direction of a descent nonlinear conjugate gradient method proposed by Zhang et al. is minimum. Under proper conditions, global convergence of the method can be achieved. To enhance eciency of the proposed method, Powell's truncation of the conjugate gradient parameters is used. The method is computationally compared with the nonlinear conjugate gradient method proposed by Zhang et al. and a modified Polak-Ribiere-Polyak method proposed by Yuan. Results of numerical comparisons show eciency of the proposed method in the sense of the Dolan-More performance profile.
引用
收藏
页码:1115 / 1124
页数:10
相关论文
共 50 条