A limited memory algorithm for bound constrained optimization

Richard H. Byrd, Peihuang Lu, Jorge Nocedal, Ciyou Zhu

Research output: Contribution to journalArticlepeer-review


An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited memory BFGS matrix to approximate the Hessian of the objective function. It is shown how to take advantage of the form of the limited memory approximation to implement the algorithm efficiently. The results of numerical tests on a set of large problems are reported.
Original languageEnglish
Pages (from-to)1190-1208
JournalSIAM Journal on Scientific Computing
StatePublished - Sep 1995


Dive into the research topics of 'A limited memory algorithm for bound constrained optimization'. Together they form a unique fingerprint.

Cite this