An algorithm is presented for solving bilevel optimization problems with fully convex lower level problems. Convergence to a local optimal solution is shown under certain weak assumptions. This algorithm uses the optimal value transformation of the problem. Transformation of the bilevel optimization problem using the Fritz-John necessary optimality conditions applied to the lower level problem is shown to exhibit almost the same difficulties for solving the problem as the use of the Karush---Kuhn---Tucker conditions.
['Stephan Dempe', 'Susanne Franke']
On the solution of convex bilevel optimization problems