Abstract
The memory gradient method is used to solve large scale unconstrained optimization problems. We investigate a closed-form step size formula given by a finite number of iterates ofWeiszfeld’s algorithm to compute the step size for a memory gradient method. This formula can be classified as a no-line search procedure since no stopping criteria is involved to ensure convergence, unlike the classical line search procedures. We show the global convergence of the memory gradient method, under weaker conditions.
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.
