[Home]   [  News]   [  Events]   [  People]   [  Research]   [  Education]   [Visitor Info]   [UCSD Only]   [Admin]
Home > Events > CCoM > Abstract
Search this site:

Randolph E. Bank
Philip E. Gill
Michael Holst

Administrative Contact:
Juan Rodriguez

Office: AP&M 7409
Phone: (858)534-9056
Fax: (858)534-5273
E-mail: jcr009@ucsd.edu
Line Search Algorithms for Projected-Gradient Quasi-Newton Methods

Michael Ferry


We briefly survey line search algorithms for unconstrained optimization. Next, we consider the search direction and line search strategies used in several algorithms that implement a quasi-Newton method for simple bounds, including algorithm L-BFGS-B. In this context, we discuss two currently-used line search algorithms and introduce a new method meant to combine the best properties of two different strategies. We present a modified L-BFGS-B method using the new line search and demonstrate its significant performance gains by numerical tests using the CUTEr test set.

Tuesday, November 10, 2009
11:00AM AP&M 2402