Abstract
We derive compact representations of BFGS and symmetric rank-one matrices for optimization. These representations allow us to efficiently implement limited memory methods for large constrained optimization problems. In particular, we discuss how to compute projections of limited memory matrices onto subspaces. We also present a compact representation of the matrices generated by Broyden's update for solving systems of nonlinear equations.
Original language | English (US) |
---|---|
Pages (from-to) | 129-156 |
Number of pages | 28 |
Journal | Mathematical Programming |
Volume | 63 |
Issue number | 1-3 |
DOIs | |
State | Published - Jan 1 1994 |
Keywords
- Quasi-Newton method
- constrained optimization
- large-scale optimization
- limited memory method
ASJC Scopus subject areas
- Software
- Mathematics(all)