A bilevel algorithm based on approximations of the reaction set mapping is proposed.
Theoretical results in classical bilevel optimization motivate the algorithm design.
Results are provided for unconstrained and constrained bilevel test problems.
Comparison results against benchmarks show a substantial performance gain.