Skip to main content
Log in

A note about sparsity exploiting quasi-Newton updates

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.E. Dennis and J.J. Moré, “Quasi-Newton methods, motivation and theory”,SIAM Review 19 (1977) 46–89.

    Google Scholar 

  2. 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).

  3. E. Marwill, “Exploiting sparsity in Newton-like methods”, Ph.D. Thesis, Cornell University (1978).

  4. 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).

  5. D.F. Shanno, “On variable metric methods for sparse hessians”,Mathematics of Computation 34 (1980) 499–514.

    Google Scholar 

  6. Ph.L. Toint, “On sparse and symmetric updating subject to a linear equation”,Mathematics of Computation 31 (1977) 954–961.

    Google Scholar 

  7. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584238

Key words

Navigation