Sufficient Descent Condition of the Polak-Ribière-Polyak (PRP) Conjugate Gradient Method without Line Search
- 1 University of Gezira, Sudan
- 2 King Khalid Universitty, Saudi Arabia
- 3 Majmaah University, Sudan
Abstract
Nonlinear conjugate gradient methods for unconstrained optimization problems are used in many aspects of theoretical and applied sciences. They are iterative methods, so at any iteration a step length is computed using a method called line search. In most cases, the sufficient descent condition plays an important role to prove the global convergence of a conjugate gradient method. Due to its outperformance in practical computation, the Polak-Ribière-Polyak (PRP) conjugate gradient method is widely used for solving nonlinear unconstrained optimization problems. However, the sufficient descent condition of PRP has not established without line search yet. In this study, we established the sufficient descent condition without line search based on the conditions 0 < bkPRP £ x bkFR and 1 < bkPRP £mbkFR, where 0 < x < 1 and m > 1. As a result, we found that under certain conditions, the sufficient descent condition is satisfied when the PRP implemented without line search
DOI: https://doi.org/10.3844/jmssp.2022.11.15
Copyright: © 2022 Abdelrahman A., KH. I. Osman, Osman O.O. Yousif, Mogtaba Mohammed, Arafa Dawood and B. A. Younis. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 2,766 Views
- 1,148 Downloads
- 0 Citations
Download
Keywords
- Conjugate Gradient Method
- Unconstrained Optimization
- Sufficient Descent Condition