Abstract
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.
Similar content being viewed by others
References
J.E. Dennis and J.J. Moré, “Quasi-Newton methods, motivation and theory”,SIAM Review 19 (1977) 46–89.
J.E. Dennis and R.B. Schnabel, “Least change secant updates for quasi-Newton methods”, Internal Report TR 78-344, Dept. of Computer Science, Cornell University (Ithaca, NY).
E. Marwill, “Exploiting sparsity in Newton-like methods”, Ph.D. Thesis, Cornell University (1978).
M.J.D. Powell, “Quasi-Newton formulae for sparse second derivative matrices”, Internal Report DAMTP 1979/NA7, Dept. of Applied Mathematics and Theoretical Physics, University of Cambridge (England).
D.F. Shanno, “On variable metric methods for sparse hessians”,Mathematics of Computation 34 (1980) 499–514.
Ph.L. Toint, “On sparse and symmetric updating subject to a linear equation”,Mathematics of Computation 31 (1977) 954–961.
Ph.L. Toint, “On the superlinear convergence of an algorithm for solving a sparse minimization problem”,SIAM Journal on Numerical Analysis 16 (1979) 1036–1045.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Toint, P. A note about sparsity exploiting quasi-Newton updates. Mathematical Programming 21, 172–181 (1981). https://doi.org/10.1007/BF01584238
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584238