Two-level value function approach to nonsmooth optimistic and pessimistic bilevel programs
Not on the map. Why?
Abstract (arXiv)
The authors' paper in Optimization 63 (2014), 505-533, see Ref. [5], was the first one to provide detailed optimality conditions for pessimistic bilevel optimization. The results there were based on the concept of the two-level optimal value function introduced and analyzed in SIAM J. Optim. 22 (2012), 1309-1343; see Ref. [4], for the case of optimistic bilevel programs. One of the basic assumptions in both of these papers is that the functions involved in the problems are at least continuously differentiable. Motivated by the fact that many real-world applications of optimization involve functions that are nondifferentiable at some points of their domain, the main goal of the current paper is extending the two-level value function approach to deriving new necessary optimality conditions for both optimistic and pessimistic versions in bilevel programming with nonsmooth data.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1; 2025: 1.
3 papers.
- 2025Countering adversarial evasion in regression analysis26 Sep 2025
- 2024On Stability in Optimistic Bilevel Optimization23 Aug 2024
- 2021A General Descent Aggregation Framework for Gradient-based Bi-level Optimization16 Feb 2021