A Limited Memory Algorithm for Bound Constrained Optimization
Richard H. Byrd, Peihuang Lu, Jorge Nocedal et al. · SIAM Journal on Scientific Computing · 1995
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.
Cited by 6,221 works. doi:10.1137/0916069
Authors
References
- The Design and Analysis of Computer Algorithms
- Iterative Solution of Nonlinear Equations in Several Variables
- Practical optimization
- On the limited memory BFGS method for large scale optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Constrained minimization methods
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations.
- Convex programming in Hilbert space
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Projected Newton Methods for Optimization Problems with Simple Constraints