Abstract

It is well known that the sufficient descent condition is very important to the global convergence of the nonlinear conjugate gradient methods. Also, the direction generated by a conjugate gradient method may not be a descent direction. In this paper, we propose a new Armijo-type line search algorithm such that the direction generated by the PRP conjugate gradient method has the sufficient descent property and ensures the global convergence of the PRP conjugate gradient method for the unconstrained minimization of nonconvex differentiable functions. We also present some numerical results to show the e?ciency of the proposed method.The results show the e?ciency of the proposed method in the sense of the performance pro?le introduced by Dolan and Mor?e.

Details

Title
A DESCENT PRP CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
Author
Nosratıpour, H; Amini, K
First page
535
Publication year
2019
Publication date
2019
Publisher
Elman Hasanoglu
e-ISSN
21461147
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2256730620
Copyright
© 2019. This work is licensed under http://creativecommons.org/licenses/by-nc/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.