Refine
Year of publication
- 2010 (1)
Language
- English (1)
Keywords
- M-stationarity (1)
- bilevel programming (1)
- calmness (1)
- discrete obstacle problem (1)
- partial calmness (1)
- value function (1)
Project
- C7 (1)
Application Area
- C (1)
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 paper 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.