In this paper, we study second-order optimality conditions for nonconvex set-constrained optimization problems. For a convex set-constrained optimization problem, it is well known that second-order…
The bilevel program is an optimization problem in which the constraint involves solutions to a parametric optimization problem. It is well known that the value function reformulation provides an eq…
The partial calmness for the bilevel programming problem (BLPP) is an important condition which ensures that a local optimal solution of BLPP is a local optimal solution of a partially penalized pr…
This paper studies bilevel polynomial optimization. We propose a method to solve it globally by using polynomial optimization relaxations. Each relaxation is obtained from the Karush--Kuhn--Tucker …