Bilevel optimization is important in AI applications, but obtaining global optimality is challenging.Bilevel problems often lack a benign landscape and may have multiple local solutions.This paper explores global convergence theory for bilevel optimization.Two sufficient conditions for global convergence are presented, with proofs and experimental validation.