Necessary optimality conditions for bilevel minimization problems
From MaRDI portal
Publication:654107
DOI10.1016/j.na.2011.03.049zbMath1254.90243OpenAlexW1992848369MaRDI QIDQ654107
Publication date: 21 December 2011
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2011.03.049
necessary optimality conditionsimplicit function theoremgeneralized differentiationbilevel minimization problem
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items (3)
Estimation of distribution algorithm for a class of nonlinear bilevel programming problems ⋮ Bilevel Optimization and Variational Analysis ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local solutions of constrained minimization problems and critical points of Lipschitz functions
- Introduction to sensitivity and stability analysis in nonlinear programming
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Existence of Exact Penalty in Constrained Optimization and the Mordukhovich Basic Subdifferential
- On the numerical solution of a class of Stackelberg problems
- Bilevel programming with discrete lower level problems
- A necessary and a sufficient optimality condition for bilevel programming problems
- New necessary optimality conditions in optimistic bilevel programming
- Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
This page was built for publication: Necessary optimality conditions for bilevel minimization problems