Abstract

In this paper, we consider the global convergence of the Polak–Ribiére–Polyak (abbreviated PRP) conjugate gradient method for unconstrained optimization problems. A new Armijo-type line search is proposed for the original PRP method and some convergence properties are given under some mild conditions. The new Armijo-type line search can make the PRP method choose a suitable initial step size so as to decrease the function evaluations at each iteration and improve the performance of the PRP method. Numerical results show that the PRP method with the new Armijo-type line search is more efficient than other similar methods in practical computation.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.