Modified PRP conjugate gradient method for unconstrained optimization

Expand
  • 1. School of Public Education, Bayingol Vocational and Technical College, Korla 841000, Xinjiang, China

Received date: 2020-09-02

  Online published: 2022-05-27

Abstract

Based on the PRP conjugate gradient method, we propose an efficient modified PRP conjugate gradient method for solving large-scaled unconstrained optimization problems by using the structure of the CG_DESCENT conjugate gradient method. The proposed method generates a sufficient descent direction at each iteration, which is independent of any line search. Its global convergence and linear convergence rate are established under standard Wolfe line search. The numerical results show that the proposed methods is effective for the given test problems.

Cite this article

Huiling ZHANG, Naoerzai SAI, Xiaoyun WU . Modified PRP conjugate gradient method for unconstrained optimization[J]. Operations Research Transactions, 2022 , 26(2) : 64 -72 . DOI: 10.15960/j.cnki.issn.1007-6093.2022.02.006

References

1 Polak E , Ribire G . Note sur la xonvergence de directions conjugees[J]. Rev Francaise informat Recherche Operatinelle 3e Annee, 1969, 16, 35- 43.
2 Polyak B T . The conjugate gradient method in extreme problems[J]. USSR Computational Mathematics and Mathematical Physics, 1969, 9, 94- 112.
3 Powell M J D . Convergence properties of algorithms for nonlinear optimization[J]. SIAM Review, 1986, 28, 487- 500.
4 Gilbert J C , Nocedal J . Global convergence properties of conjugate gradient methods for optimization[J]. SIAM Journal on Optimization, 1992, 2, 21- 42.
5 Hestenes M R , Stiefel E L . Methods of conjugate gradients for solving linear systems[J]. Journal of Research of the National Bureau of Standards, 1952, 5, 409- 432.
6 Hager W W , Zhang H . A new conjugate gradient method with guaranteed descent and an efficient line search[J]. SIAM Journal on Optimization, 2005, 16, 170- 192.
7 Liu J K . A new nonlinear conjugate gradient method and its global convergence[J]. 数学杂志, 2013, 33, 1036- 1042.
8 赛·闹尔再, 张慧玲. 修正LS共轭梯度方法及其收敛性[J]. 西南师范大学学报(自然科学版), 2016, 41, 20- 26.
9 刘金魁, 张春涛. 三项修正LS共轭梯度方法及其收敛性研究[J]. 应用数学学报, 2017, 40, 862- 873.
10 Saman B K , Reza G . A class of adaptive Dai-Liao conjugate gradient methods based on the scaled memoryless BFGS update[J]. 4OR-A Quarterly Journal of Operations Research, 2017, 15, 85- 92.
11 Dong X L , Han D R , Dai Z F , et al. An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition[J]. Journal of Optimization Theory and Applications, 2018, 179, 944- 961.
12 Jian J B , Yang L , Jiang X Z , et al. A spectral conjugate gradient method with descent property[J]. Mathematics, 2020, 8, 280.
13 Liu M X , Yin J H , Ma G D . Two new conjugate gradient methods for unconstrained optimization[J]. Complexity, 2020, 2020.
14 Awwal A M , Kumam P , Abubakar A B . Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations[J]. Applied Numerical Mathematics, 2019, 362, 124514.
15 Yuan G L , Li T T , Hu W J . A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems[J]. Applied Numerical Mathematics, 2020, 147, 129- 141.
16 Zoutendijk G . Nonlinear programming, computational methods[J]. Integer and Nonlinear Programming, 1970, 37- 86.
17 Liu J K , Feng Y M , Zou L M . Some three-term conjugate gradient methods with the inexact line search condition[J]. Calcolo, 2018, 55, 16.
18 Bongartz I , Conn A R , Gould N I M , et al. CUTE: constrained and unconstrained testing environments[J]. ACM Transactions on Mathematical Software, 1995, 21, 123- 160.
19 Andrei N . An unconstrained optimization test functions collection[J]. Advanced Modeling and Optimization, 2008, 10, 147- 161.
20 Dolan E D , Moré J J . Benchmarking optimization software with performance profiles[J]. Mathematical Programming, 2002, 91, 201- 213.
Outlines

/