A new variant of the memory gradient method for unconstrained optimization

A new variant of the memory gradient method for unconstrained optimization

0.00 Avg rating0 Votes
Article ID: iaor20127289
Volume: 6
Issue: 8
Start Page Number: 1643
End Page Number: 1655
Publication Date: Dec 2012
Journal: Optimization Letters
Authors: ,
Keywords: heuristics
Abstract:

In this paper, we present a new memory gradient method such that the direction generated by this method provides a sufficient descent direction for the objective function at every iteration. Then, we analyze its global convergence under mild conditions and convergence rate for uniformly convex functions. Finally, we report some numerical results to show the efficiency of the proposed method.

Reviews

Required fields are marked *. Your email address will not be published.