Abstract
Conjugate gradient method is the most used for solving the unconstrained optimization problem. In this paper we propose a new hybrid conjugate gradient method which is obtained from a convex combination of FR and BA. Under some conditions the given method have the sufficient descent and global convergence property. Numerical results and their performance support the effectiveness and robustness of our procedure.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
