Abstract
In this paper, a modified FR conjugate gradient method(MFR) is presented for solving unconstrained optimization problems. The sufficient descent property of the MFR method is satisfied without any line search. Moreover, the MFR method reduces to the standard FR method if line search is exact. Under some mild conditions, the theory of global convergence is established. Numerical results are also given to show the efficiency of the MFR method.
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: DEStech Transactions on Computer Science and Engineering
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.
