New necessary optimality conditions in optimistic bilevel programming

By Stephan Dempe, Joydeep Dutta, Boris S. Mordukhovich. 2007

173 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/650623bb9c1c6aa7d6da74265007d21ad8a78f23

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. Kalyanmoy Deb
2. Joydeep Dutta
3. Pekka Malo
4. Ankur Sinha
5. Nguyen Dinh
6. Susanne Franke
7. Stephan Dempe
8. Yaochu Jin

In Control and Systems Engineering

1. Kalyanmoy Deb
2. Joydeep Dutta
3. Nguyen Dinh
4. Susanne Franke
5. Stephan Dempe
6. Pekka Malo
7. Ankur Sinha
8. Yaoyao Liu

In Geometry and Topology

1. Nguyen Dinh
2. Joydeep Dutta
3. Stephan Dempe
4. Kalyanmoy Deb
5. Pekka Malo
6. Ankur Sinha
7. Susanne Franke

Citations in the corpus

• On the solution of convex bilevel optimization problems (2015, background): “Bilevel optimization has been a driving force to investigate topics in variational analysis (cf. e.g. Dempe et al. [11]), it is closely related to (generalized) semi-infinite programming ((G)SIP) (see Günzel et al. [12], Stein [13], Stein and Still [14], Weber [15]), mathematical programs with…”
• A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications (2017, background): “See [58], [60], [80], [105], [106], [126] for further discussion on existence of optimistic bilevel optimum and additional results on optimality conditions.”
• Optimality Conditions for a Simple Convex Bilevel Programming Problem (2010, methodology): “For details on these approaches see, for example, Dempe [2], Dutta and Dempe [10], Dempe et al. [3, 4 ] and the references there in.”