On calmness conditions in convex bilevel programming

By René Henrion, Thomas M. Surowiec. 2011

66 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/2dd2238b083c9f5e9ddfec35f80064d75354c90c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Susanne Franke
2. Stephan Dempe
3. Joydeep Dutta
4. Maria Paola Scaparra
5. Richard L. Church

In Geometry and Topology

1. Susanne Franke
2. Stephan Dempe

In Numerical Analysis

1. Stephan Dempe
2. Susanne Franke

Citations in the corpus

• On the solution of convex bilevel optimization problems (2015, methodology): “This can be realized using the optimal value function of problem (1.2) (see e.g. Ye and Zhu [20]), a generalized equation (Henrion and Surowiec [21]) or by replacing the lower level problem with the Karush–Kuhn–Tucker conditions.”