A modified three–term conjugate gradient method with sufficient descent property

被引:0
作者
Saman Babaie-Kafaki
机构
[1] Semnan University,Department of Mathematics, Faculty of Mathematics, Statistics and Computer Science
来源
Applied Mathematics-A Journal of Chinese Universities | 2015年 / 30卷
关键词
unconstrained optimization; conjugate gradient method; eigenvalue; sufficient descent condition; global convergence; 65K05; 90C53; 26D20; 15A18;
D O I
暂无
中图分类号
学科分类号
摘要
A hybridization of the three-term conjugate gradient method proposed by Zhang et al. and the nonlinear conjugate gradient method proposed by Polak and Ribière, and Polyak is suggested. Based on an eigenvalue analysis, it is shown that search directions of the proposed method satisfy the sufficient descent condition, independent of the line search and the objective function convexity. Global convergence of the method is established under an Armijo-type line search condition. Numerical experiments show practical efficiency of the proposed method.
引用
收藏
页码:263 / 272
页数:9
相关论文
共 52 条
[1]  
Andrei N(2007)Numerical comparison of conjugate gradient algorithms for unconstrained optimization Stud Inform Control 16 333-352
[2]  
Andrei N(2011)A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization Optimization 60 1457-1471
[3]  
Babaie–Kafaki S(2014)An eigenvalue study on the sufficient descent property of a modified Polak–Ribière–Polyak conjugate gradient method Bull Iranian Math Soc 40 235-242
[4]  
Babaie–Kafaki S(2012)A quadratic hybridization of Polak–Ribière–Polyak and Fletcher–Reeves conjugate gradient methods J Optim Theory Appl 154 916-932
[5]  
Cheng W(2007)A two–term PRP–based descent method Numer Funct Anal Optim 28 1217-1230
[6]  
Dai Y H(1999)Convergence properties of nonlinear conjugate gradient methods SIAM J Optim 10 348-358
[7]  
Han J Y(2001)New conjugacy conditions and related nonlinear conjugate gradient methods Appl Math Optim 43 87-101
[8]  
Liu G H(2010)Two modified Polak–Ribière–Polyak–type nonlinear conjugate methods with sufficient descent property Numer Funct Anal Optim 31 892-906
[9]  
Sun D F(2002)Benchmarking optimization software with performance profiles Math Program Ser A 91 201-213
[10]  
Yin H X(2003)CUTEr: a constrained and unconstrained testing environment, revisited ACM Trans Math Software 29 373-394