Abstract
In this paper, we present extension forms of Dai, Yuan (DY) and Fletcher, Reveres (FR) CG algorithms. Our modifications and based on introducing a non-quadratic model (sigmoid function model). These modified algorithms are implemented with Wolfe conditions, where initial step size in each iteration is taken as and the global convergence of the modified DY algorithm is investigated. These modified algorithms are tested on some standard test functions and compared with the original DY and FR algorithms showing considerable improvements over all these comparisons.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
