Preprocessing for quadratic programming

Nick Gould, Philippe Toint

    Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

    20 Téléchargements (Pure)

    Résumé

    Techniques for the preprocessing of (not-necessarily convex) quadratic programs are discussed. Most of the procedures extend known ones from the linear to quadratic cases, but a few new preprocessing techniques are introduced. The implementation aspects are also discussed. Numerical results are finally presented to indicate the potential of the resulting code, both for linear and quadratic problems. The impact of insisting that bounds of the variables in the reduced problem be as tight as possible rather than allowing some slack in these bounds is also shown to be numerically significant. © Springer-Verlag Berlin Heidelberg 2004.
    langue originaleAnglais
    Pages (de - à)95-132
    Nombre de pages38
    journalMathematical Programming
    Volume100
    Numéro de publication1
    Les DOIs
    Etat de la publicationPublié - 1 mai 2004

    Empreinte digitale Examiner les sujets de recherche de « Preprocessing for quadratic programming ». Ensemble, ils forment une empreinte digitale unique.

    Contient cette citation