Abstract
In this paper, an efficient new nonlinear conjugate gradient method is proposed for the unconstrained optimization problems, which possesses the following property: the sufficient descent conditiong T k dk = −kgkk 2 holds with- out any line search. Under the strong Wolf Non-monotone line search, we proved the global convergence of the FR method for strongly convex functions. The numerical experiments show that the FR method is especially efficient.
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 callMore From: International Journal of Pure and Apllied Mathematics
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.
