Quadratic programming

Berwin Turlach, S.J. Wright

    Research output: Contribution to journalArticlepeer-review

    4 Citations (Scopus)


    © 2015 Wiley Periodicals, Inc. Optimization problems in which a quadratic objective function is optimized subject to linear constraints on the parameters are known as quadratic programming problems (QPs). This focus article reviews algorithms for convex QPs (in which the objective is a convex function) and provides pointers to various online resources about QPs.
    Original languageEnglish
    Pages (from-to)153-159
    JournalWiley Interdisciplinary Reviews: Computational Statistics
    Issue number2
    Publication statusPublished - 2015


    Dive into the research topics of 'Quadratic programming'. Together they form a unique fingerprint.

    Cite this