Optimization Online


A Limited Memory Steepest Descent Method

Roger Fletcher(fletcher***at***maths.dundee.ac.uk)

Abstract: The possibilities inherent in steepest descent methods have been considerably amplified by the introduction of the Barzilai-Borwein choice of step-size, and other related ideas. These methods have proved to be competitive with conjugate gradient methods for the minimization of large dimension unconstrained minimization problems. This paper suggests a method which is able to take advantage of the availability of a few additional `long' vectors of storage to achieve a significant improvement in performance, both for quadratic and non-quadratic objective functions. It makes use of certain Ritz values related to the Lanczos process. Some underlying theory is provided, and numerical evidence is set out showing that the new method provides a competitive and more simple alternative to the state of the art l-BFGS limited memory method.

Keywords: Steepest Descent, Barzilai-Borwein, Limited Memory, Ritz values

Category 1: Applications -- OR and Management Sciences

Category 2: Nonlinear Optimization (Unconstrained Optimization )

Citation: Edinburgh Research Group in Optimization, Technical Report ERGO 09-014, December 2nd, 2009 Edinburgh University, Kings Buildings, Mayfield Road, Edinburgh, Scotland UK

Download: [PDF]

Entry Submitted: 12/02/2009
Entry Accepted: 12/06/2009
Entry Last Modified: 12/02/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society