An iterative working-set method for large-scale nonconvex quadratic programming

Nick Gould, Philippe Toint

    Research output: Contribution to journalArticlepeer-review

    74 Downloads (Pure)

    Abstract

    We consider a working-set method for solving large-scale quadratic programming problems for which there is no requirement that the objective function be convex. The methods are iterative at two levels, one level relating to the selection of the current working set, and the second due to the method used to solve the equality-constrained problem for this working set. A preconditioned conjugate gradient method is used for this inner iteration, with the preconditioner chosen especially to ensure feasibility of the iterates. The preconditioner is updated at the conclusion of each outer iteration to ensure that this feasibility requirement persists. The well-known equivalence between the conjugate-gradient and Lanczos methods is exploited when finding directions of negative curvature. Details of an implementation - the Fortran 90 package QPA in the forthcoming GALAHAD library - are given.
    Original languageEnglish
    Pages (from-to)109-128
    Number of pages20
    JournalApplied Numerical Mathematics
    Volume43
    Issue number1-2
    DOIs
    Publication statusPublished - 1 Oct 2002

    Fingerprint

    Dive into the research topics of 'An iterative working-set method for large-scale nonconvex quadratic programming'. Together they form a unique fingerprint.

    Cite this