51
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Convergence of memory gradient methods

&
Pages 1039-1053 | Received 09 Jan 2007, Accepted 16 May 2007, Published online: 04 Mar 2011
 

Abstract

In this paper we present a new class of memory gradient methods for unconstrained optimization problems and develop some useful global convergence properties under some mild conditions. In the new algorithms, trust region approach is used to guarantee the global convergence. Numerical results show that some memory gradient methods are stable and efficient in practical computation. In particular, some memory gradient methods can be reduced to the BB method in some special cases.

2000 AMS Subject Classification :

Acknowledgements

The authors would like to thank three anonymous referees and the editor for their comments and suggestions that greatly improved the paper. This work was supported in part by NSF CNS-0521142, USA.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.