Measures for Symmetric Rank-One Updates

Measures of deviation of a symmetric positive definite matrix from the identity are derived. They give rise to symmetric rank-one, SR1, type updates. The measures are motivated by considering the volume of the symmetric difference of the two ellipsoids, which arise from the current and updated quadratic models in quasi-Newton methods. The measure defined by the problem—maximize the determinant subject to a bound of 1 on the largest eigenvalue—yields the SR1 update. The measure σ( A ) = λ 1 ( A )/det( A ) 1/ n yields the optimally conditioned, sized, symmetric rank-one updates. The volume considerations also suggest a ‘correction’ for the initial stepsize for these sized updates. It is then shown that the σ-optimal updates, as well as the Oren-Luenberger self-scaling updates, are all optimal updates for the κ measure, the l 2 condition number. Moreover, all four sized updates result in the same largest (and smallest) ‘scaled’ eigenvalue and corresponding eigenvector. In fact, the inversesized BFGS is the mean of the σ-optimal updates, while the inverse of the sized DFP is the mean of the inverses of the σ-optimal updates. The difference between these four updates is determined by the middle n − 2 scaled eigenvalues. The κ measure also provides a natural Broyden class replacement for the SR1 when it is not positive definite.

[1]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[2]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[3]  P. Gill,et al.  Quasi-Newton Methods for Unconstrained Optimization , 1972 .

[4]  D. Luenberger,et al.  Self-Scaling Variable Metric (SSVM) Algorithms , 1974 .

[5]  William C. Davidon,et al.  Optimally conditioned optimization algorithms without line searches , 1975, Math. Program..

[6]  Robert B. Schnabel,et al.  Analyzing and Improving Quasi-Newton Methods for Unconstrained Optimization , 1977 .

[7]  D. F. Shanno,et al.  Matrix conditioning and nonlinear optimization , 1978, Math. Program..

[8]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[9]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[10]  E. Spedicato A class of rank-one positive definite qnasi-newton updates for unconstrained minimization 2 , 1983 .

[11]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[12]  R. Fletcher Semi-Definite Matrix Constraints in Optimization , 1985 .

[13]  J. J. Moré,et al.  Quasi-Newton updates with bounds , 1987 .

[14]  M. Todd,et al.  Optimal conditioning and convergence in rank one quasi-Newton updates , 1988 .

[15]  J. Nocedal,et al.  A tool for the analysis of Quasi-Newton methods with application to unconstrained minimization , 1989 .

[16]  Roger Fletcher,et al.  A New Variational Result for Quasi-Newton Formulae , 1991, SIAM J. Optim..

[17]  Nicholas I. M. Gould,et al.  Convergence of quasi-Newton matrices generated by the symmetric rank one update , 1991, Math. Program..

[18]  J. Dennis,et al.  Sizing and least-change secant methods , 1993 .

[19]  Jorge Nocedal,et al.  Analysis of a self-scaling quasi-Newton method , 1993, Math. Program..