Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072438
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 9:57:53 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:07:40 PM

Identifiers

  • HAL Id : inria-00072438, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

163

Files downloads

533