Limited-memory BFGS Systems with Diagonal Updates

Details Limited-memory BFGS Systems with Diagonal Updates Limited-memory BFGS Systems with Diagonal Updates

2011-12-28

arxiv.org/abs/1112.6060v2

Mathematics

Numerical Analysis

Scientific paper

In this paper, we investigate a formula to solve systems of the form (B + {\sigma}I)x = y, where B is a limited-memory BFGS quasi-Newton matrix and {\sigma} is a positive constant. These types of systems arise naturally in large-scale optimization such as trust-region methods as well as doubly-augmented Lagrangian methods. We show that provided a simple condition holds on B_0 and \sigma, the system (B + \sigma I)x = y can be solved via a recursion formula that requies only vector inner products. This formula has complexity M^2n, where M is the number of L-BFGS updates and n >> M is the dimension of x.

Affiliated with

Also associated with

No associations

Rating

Limited-memory BFGS Systems with Diagonal Updates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limited-memory BFGS Systems with Diagonal Updates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limited-memory BFGS Systems with Diagonal Updates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32154