Abstract
Based on nonmonotone Armijo line search, the paper proposes a new nonmonotone line search and investigates a memory gradient method with this line search. Its global convergence is also proved under some mild conditions. As compared with nonmonotone Armijo rule, the new nonmonotone line search can effectively reduce the function evaluations by choosing a larger accepted stepsize at each iteration so as to reduce the computation of algorithm.
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.
