A new sufficient descent conjugate gradient method with exact line search

• Published in: AIP Conference Proceedings
• Main Author: Idalisa N.; Rivaie M.; Fadhilah N.H.; Nasir M.A.S.
• Format: Conference paper
• Language: English
• Published: American Institute of Physics Inc. 2019
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076753588&doi=10.1063%2f1.5136479&partnerID=40&md5=cacccede4189d18ff119d607b0b8be51

The seminal paper by Hestenes and Stieffel [7] has given rise to an extensive investigation, leading to the development of effective conjugate gradient (CG) methods. In this paper, a new CG algorithm with exact line search which guarantees sufficient descent is proposed. The proposed method is a modified three-term type CG algorithm where the initial search direction is slightly deflected from the currently used Steepest Descent (SD) method. The proposed method is compared with the existing CG methods. These methods were tested using the standard unconstrained optimization functions. Experimental results provide evidence that the proposed method is in general superior to the classical CG methods and has a potential to significantly enhance the computational efficiency and robustness of the optimization method. These algorithms have been carried out by MATLAB R2016a, Intel(R) Core™ i3-7100U CPU @ 2.40GHz RAM 4.GB PC environment. © 2019 Author(s).