Towards an Efficient Sparsity Exploiting Newton Method for Minimization

    Research output: Contribution in Book/Catalog/Report/Conference proceedingChapter (peer-reviewed)

    Abstract

    The paper surveys some recently proposed algorithms for unconstrained minimization when second derivative of the objective function is sparse. Updating and estimation procedures are considered from the efficiency point of view. Special attention is given to the case where the Hessian has a band structure. A new strategy for the choice of the step is also discussed and some numerical results on a specially designed test function are presented.
    Original languageEnglish
    Title of host publicationSparse Matrices and Their Uses
    EditorsI. S Duff
    Place of PublicationLondon
    PublisherAcademic press
    Pages57-88
    Number of pages32
    Publication statusPublished - 1981

    Fingerprint Dive into the research topics of 'Towards an Efficient Sparsity Exploiting Newton Method for Minimization'. Together they form a unique fingerprint.

  • Projects

    Cite this

    Toint, P. (1981). Towards an Efficient Sparsity Exploiting Newton Method for Minimization. In I. S. Duff (Ed.), Sparse Matrices and Their Uses (pp. 57-88). Academic press.