Abstract
In this paper, a modified Liu–Storey conjugate gradient method is proposed. The method can generate sufficient descent directions for non-linear unconstrained optimization problems. A global convergence result is established when the line search fulfils the strong Wolfe conditions. Moreover, the -linear convergence rate of the methods is proved. The extensive numerical results show that the proposed method is efficient for the unconstrained optimization problems in the CUTEr library.
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.
