Bilevel optimization: on the structure of the feasible set

DOI10.1007/S10107-012-0551-XMaRDI QIDQ1925784zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

bilevel programmingparametric optimizationstructure of the feasible setcoupling constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• On the solution of convex bilevel optimization problems
• scientific article; zbMATH DE number 2242722
• Optimality conditions for bilevel programming problems
• Optimality conditions for bilevel programming problems
• scientific article; zbMATH DE number 432976
• Optimality conditions for bilevel programming problems
• Necessary optimality conditions for bilevel set optimization problems
• Bilevel optimization with nonsmooth lower level problems
• Optimality conditions for the bilevel programming problem
• Optimality results for a specific bilevel optimization problem

Cites work

• scientific article; zbMATH DE number 4152171 (Why is no real title available?)
• scientific article; zbMATH DE number 3716458 (Why is no real title available?)
• scientific article; zbMATH DE number 3473031 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• A necessary and a sufficient optimality condition for bilevel programming problems
• Critical sets in parametric optimization
• Differential Topology
• Foundations of bilevel programming
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• On Reducibility in Bilevel Problems
• Optimality conditions for bilevel programming problems
• Practical bilevel optimization. Algorithms and applications

Cited in

(10)

• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
• Solving bilevel programs with the KKT-approach
• Genericity analysis of multi-leader-disjoint-followers game
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
• Generic property of the partial calmness condition for bilevel programming problems
• On the use of intersection cuts for bilevel optimization
• A cutting plane approach for solving linear bilevel programming problems
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Interactions between bilevel optimization and Nash games
• On intrinsic complexity of Nash equilibrium problems and bilevel optimization

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)