Bilevel optimization: on the structure of the feasible set
DOI10.1007/S10107-012-0551-XzbMATH Open1286.90150OpenAlexW2037904604MaRDI QIDQ1925784FDOQ1925784
Hubertus T. Jongen, Vladimir Shikhman
Publication date: 19 December 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0551-x
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Differential Topology
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Optimality conditions for bilevel programming problems
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
- A necessary and a sufficient optimality condition for bilevel programming problems
- Critical sets in parametric optimization
- On Reducibility in Bilevel Problems
Cited In (10)
- Genericity Analysis of Multi-Leader-Disjoint-Followers Game
- Generic Property of the Partial Calmness Condition for Bilevel Programming Problems
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Solving bilevel programs with the KKT-approach
- Interactions Between Bilevel Optimization and Nash Games
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- On the use of intersection cuts for bilevel optimization
- On intrinsic complexity of Nash equilibrium problems and bilevel optimization
- A Cutting Plane Approach for Solving Linear Bilevel Programming Problems
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- On the solution of convex bilevel optimization problems 👍 👎
- Optimality conditions for bilevel programming problems 👍 👎
- Optimality conditions for the bilevel programming problem 👍 👎
- Optimality conditions for bilevel programming problems 👍 👎
- Optimality conditions for bilevel programming problems 👍 👎
- Necessary optimality conditions for bilevel set optimization problems 👍 👎
- Bilevel Optimization with Nonsmooth Lower Level Problems 👍 👎
- Optimality results for a specific bilevel optimization problem 👍 👎
This page was built for publication: Bilevel optimization: on the structure of the feasible set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925784)
