A trust-region method for nonlinear bilevel programming: algorithm and computational experience

Benoit Colson, Patrice MARCOTTE, Gilles SAVARD

    Research output: Book/Report/JournalOther report

    Abstract

    We consider the approximation of nonlinear bilevel mathematical programs by solvable programs of the same type, i.e., bilevel programs involving linear approximations of the upper-level objective and all constraint-defining functions, as well as a quadratic approximation of the lower-level objective. We describe the main features of the algorithm and the resulting software. Preliminary numerical experiments tend to confirm the remarkable behavior of the method.
    Original languageEnglish
    Place of PublicationNamur, Belgique
    PublisherFUNDP, Faculté des Sciences. Département de Mathématique.
    Publication statusPublished - 2002

    Keywords

    • bilevel programming
    • numerical results
    • approximation
    • trust-region methods
    • nonlinear programming

    Fingerprint

    Dive into the research topics of 'A trust-region method for nonlinear bilevel programming: algorithm and computational experience'. Together they form a unique fingerprint.

    Cite this