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

Fingerprint

Bilevel Programming
Trust Region Method
Nonlinear Programming
Quadratic Approximation
Linear Approximation
Numerical Experiment
Tend
Software
Approximation
Experience

Keywords

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

Cite this

Colson, B., MARCOTTE, P., & SAVARD, G. (2002). A trust-region method for nonlinear bilevel programming: algorithm and computational experience. Namur, Belgique: FUNDP, Faculté des Sciences. Département de Mathématique.
Colson, Benoit ; MARCOTTE, Patrice ; SAVARD, Gilles. / A trust-region method for nonlinear bilevel programming: algorithm and computational experience. Namur, Belgique : FUNDP, Faculté des Sciences. Département de Mathématique., 2002.
@book{09719c327f9e4054934b3eda0f857899,
title = "A trust-region method for nonlinear bilevel programming: algorithm and computational experience",
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.",
keywords = "bilevel programming, numerical results, approximation, trust-region methods, nonlinear programming",
author = "Benoit Colson and Patrice MARCOTTE and Gilles SAVARD",
year = "2002",
language = "English",
publisher = "FUNDP, Facult{\'e} des Sciences. D{\'e}partement de Math{\'e}matique.",

}

Colson, B, MARCOTTE, P & SAVARD, G 2002, A trust-region method for nonlinear bilevel programming: algorithm and computational experience. FUNDP, Faculté des Sciences. Département de Mathématique., Namur, Belgique.

A trust-region method for nonlinear bilevel programming: algorithm and computational experience. / Colson, Benoit; MARCOTTE, Patrice; SAVARD, Gilles.

Namur, Belgique : FUNDP, Faculté des Sciences. Département de Mathématique., 2002.

Research output: Book/Report/JournalOther report

TY - BOOK

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

AU - Colson, Benoit

AU - MARCOTTE, Patrice

AU - SAVARD, Gilles

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - bilevel programming

KW - numerical results

KW - approximation

KW - trust-region methods

KW - nonlinear programming

M3 - Other report

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

PB - FUNDP, Faculté des Sciences. Département de Mathématique.

CY - Namur, Belgique

ER -

Colson B, MARCOTTE P, SAVARD G. A trust-region method for nonlinear bilevel programming: algorithm and computational experience. Namur, Belgique: FUNDP, Faculté des Sciences. Département de Mathématique., 2002.