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.