On calmness conditions in convex bilevel programming

Abstract

In this article, we compare two different calmness conditions which are widely used in the literature on bilevel programming and on mathematical programs with equilibrium constraints. In order to do so, we consider convex bilevel programming as a kind of intersection between both research areas. The so-called partial calmness concept is based on the function value approach for describing the lower level solution set. Alternatively, calmness in the sense of multifunctions may be considered for perturbations of the generalized equation representing the same lower level solution set. Both concepts allow to derive first-order necessary optimality conditions via tools of generalized differentiation introduced by Mordukhovich. They are very different, however, concerning their range of applicability and the form of optimality conditions obtained. The results of this article seem to suggest that partial calmness is considerably more restrictive than calmness of the perturbed generalized equation. This fact is also illustrated by means of a dicretized obstacle control problem.

Keywords:

• bilevel programming
• partial calmness
• M-stationarity
• value function
• calmness
• discrete obstacle problem

AMS Subject Classifications::

• 90C30
• 49J53

Acknowledgements

This work was supported by the DFG Research Center Matheon ‘Mathematics for key technologies’ in Berlin