On the Convergence of the Algorithm for Bilevel Programming Problems by Clegg and Smith - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

On the Convergence of the Algorithm for Bilevel Programming Problems by Clegg and Smith

Abstract

In [1,2], Smith and colleagues present an algorithm for solving the bilevel programming problem. We show that the points reached by the algorithm are not stationary points of bilevel programs in general. We further show that, with a minor modification, this method can be expressed as an inexact penalty method for gap function-constrained bilevel programs.
Fichier principal
Vignette du fichier
RR-4185.pdf (172.94 Ko) Télécharger le fichier

Dates and versions

inria-00072438 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072438 , version 1

Cite

Guy Cohen, Jean-Pierre Quadrat, Laura Wynter. On the Convergence of the Algorithm for Bilevel Programming Problems by Clegg and Smith. [Research Report] RR-4185, INRIA. 2001. ⟨inria-00072438⟩
84 View
28807 Download

Share

Gmail Facebook Twitter LinkedIn More