Stable reduced Hessian updates for indefinite quadratic programming

R. Fletcher

    Research output: Contribution to journalArticlepeer-review

    15 Citations (Scopus)


    Stable techniques are considered for updating the reduced Hessian matrix that arises in a null-space active set method for quadratic programming when the Hessian matrix itself may be indefinite. A scheme for defining and updating the null-space basis matrix is described which is adequately stable and allows advantage to be taken of sparsity in the constraint matrix. A new canonical form for the reduced Hessian matrix is proposed that can be updated in a numerically stable way. Some consequences for the choice of minor iteration search direction are described.
    Original languageEnglish
    Pages (from-to)251-264
    Number of pages14
    JournalMathematical Programming
    Issue number2
    Publication statusPublished - 1 Apr 2000


    Dive into the research topics of 'Stable reduced Hessian updates for indefinite quadratic programming'. Together they form a unique fingerprint.

    Cite this