Optimality Conditions for a Simple Convex Bilevel Programming Problem

By Stephan Dempe, Nguyen Dinh, Joydeep Dutta. 2010

49 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Numerical Analysis

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

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. Ruichen Jiang
2. Nazanin Abolfazli
3. Aryan Mokhtari
4. Erfan Yazdandoost Hamedani

In Control and Systems Engineering

1. Aryan Mokhtari

In Numerical Analysis

1. Ruichen Jiang
2. Nazanin Abolfazli
3. Aryan Mokhtari
4. Erfan Yazdandoost Hamedani

Citations in the corpus

• A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem (2022, background): “We remark that problem (1) is often referred to as the “simple bilevel problem” in the literature (Dempe et al., 2010; Dutta and Pandit, 2020; Shehu et al., 2021) to differentiate it from the more general settings where the lower-level problem is parameterized by some upper-level variables.”