Abstract
An iterative conjugate gradient (CG) method is prominently known for dealing with unconstrained optimization problem. A new CG method which is modified by Wei Yao Liu (WYL) method is tested by standard test functions. Moreover, the step size is calculated using exact line search. Theoretical proofs on convergence analysis are shown. As a result, this new CG is comparable to the other methods in finding the optimal points by measuring the total iterations required as well as the computing time. Numerical results showed the execution between three CG methods in details.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
