Back to Search Start Over

STATISTICAL QUASI-NEWTON: A NEW LOOK AT LEAST CHANGE.

Authors :
Chuanhai Liu
Wiel, Scott A. Vander
Source :
SIAM Journal on Optimization; 2007, Vol. 18 Issue 4, p1266-1285, 20p, 2 Charts, 3 Graphs
Publication Year :
2007

Abstract

A new method for quasi-Newton minimization outperforms BFGS by combining least-change updates of the Hessian with step sizes estimated from a Wishart model of uncertainty. The Hessian update is in the Broyden family but uses a negative parameter, outside the convex range, that is usually regarded as the safe zone for Broyden updates. Although full Newton steps based on this update tend to be too long, excellent performance is obtained with shorter steps estimated from the Wishart model. In numerical comparisons to BFGS the new statistical quasi-Newton (SQN) algorithm typically converges with about 25% fewer iterations, functions, and gradient evaluations on the top 1/3 hardest unconstrained problems in the CUTE library. Typical improvement on the 1/3 easiest problems is about 5%. The framework used to derive SQN provides a simple way to understand differences among various Broyden updates such as BFGS and DFP and shows that these methods do not preserve accuracy of the Hessian, in a certain sense, while the new method does. In fact, BFGS, DFP, and all other updates with nonnegative Broyden parameters tend to inflate Hessian estimates, and this accounts for their observed propensity to correct eigenvalues that are too small more readily than eigenvalues that are too large. Numerical results on three new test functions validate these conclusions. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
10526234
Volume :
18
Issue :
4
Database :
Complementary Index
Journal :
SIAM Journal on Optimization
Publication Type :
Academic Journal
Accession number :
27827243
Full Text :
https://doi.org/10.1137/040614700