BEHAVIOR OF THE COMBINATION OF PRP AND HZ METHODS FOR UNCONSTRAINED OPTIMIZATION

被引:4
作者
Delladji, Sarra [1 ]
Belloufi, Mohammed [1 ]
Sellami, Badreddine [1 ]
机构
[1] Mohamed Cherif Messaadia Univ, Lab Informat & Math LiM, Souk Ahras 41000, Algeria
来源
NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION | 2021年 / 11卷 / 03期
关键词
hybrid conjugate gradient; convex com-bination; sufficient descent; global convergence; Unconstrained optimization; CONJUGATE-GRADIENT METHOD; GLOBAL CONVERGENCE; ALGORITHM; DESCENT;
D O I
10.3934/naco.2020032
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
To achieve a conjugate gradient method which is strong in theory and efficient in practice for solving unconstrained optimization problem, we propose a hybridization of the Hager and Zhang (HZ) and Polak-Ribiere and Polyak (PRP) conjugate gradient methods which possesses an important property of the well known PRP method: the tendency to turn towards the steepest descent direction if a small step is generated away from the solution, averting a sequence of tiny steps from happening, the new scalar fik is obtained by convex combination of PRP and HZ under the wolfe line search we prove the sufficient descent and the global convergence. Numerical results are reported to show the effectiveness of our procedure.
引用
收藏
页码:377 / 389
页数:13
相关论文
共 18 条