Fundamental Limitations of First-Order Methods for Solving Convex Simple Bilevel Optimization Problems

First-order zero-respecting algorithms cannot find (ǫf, ǫg)-absolute optimal solutions for convex simple bilevel optimization problems, even in smooth and Lipschitz settings.