A note about sparsity exploiting quasi-Newton updates
暂无分享,去创建一个
This paper is concerned with two questions relating to quasi-Newton updates for unconstrained optimization that exploit any sparsity present in the second derivative matrix of the objective function. First, a family of such updates is derived, that reduces to any a priori known dense update formula when no sparsity is imposed. This family uses the Frobenius projection of the desired update on the subspace of matrices that satisfy all the needed conditions. In the second part, we prove that, under mild assumptions, a positive definite sparse quasi-Newton update always exists. The proof of this result includes the explicit determination of such an update.
[1] J. J. Moré,et al. Quasi-Newton Methods, Motivation and Theory , 1974 .
[2] P. Toint. On sparse and symmetric matrix updating subject to a linear equation , 1977 .
[3] R. Schnabel,et al. Least Change Secant Updates for Quasi-Newton Methods , 1978 .
[4] P. Toint. On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem , 1979 .
[5] D. Shanno. On variable-metric methods for sparse Hessians , 1980 .