Duality-based single-level reformulations of bilevel optimization problems
From MaRDI portal
Cites work
- A duality theorem for non-linear programming
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- A new tour on the subdifferential of the supremum function
- A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS
- A solution method for the linear static Stackelberg problem using penalty functions
- A Strict Converse Duality Theorem in Nonlinear Programming
- An evolutionary algorithm for solving bilevel programming problems using duality conditions
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
- Detecting and solving aircraft conflicts using bilevel programming
- Duality with generalized convexity
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Foundations of bilevel programming
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3847230 (Why is no real title available?)
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 1163114 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
- Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Optimization Problems in the Constraints
- MPEC methods for bilevel optimization problems
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- New necessary optimality conditions in optimistic bilevel programming
- On calmness conditions in convex bilevel programming
- On computation of generalized derivatives of the normal-cone mapping and their applications
- On computation of limiting coderivatives of the normal-cone mapping to inequality systems and their applications
- On implicit variables in optimization theory
- On M-stationarity conditions in MPECs and the associated qualification conditions
- On the numerical solution of a class of Stackelberg problems
- Optimality conditions for bilevel programmes via Moreau envelope reformulation*
- Optimality conditions for bilevel programming problems
- Optimality conditions for the bilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
- Robinson Stability of Parametric Constraint Systems via Variational Analysis
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Solution of bilevel optimization problems using the KKT approach
- Solving bilevel programs based on lower-level Mond-Weir duality
- Solving bilevel programs with the KKT-approach
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings
- Technical Note—On Converse Duality in Nonlinear Programming
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Two-Level Planning
- Variational Analysis
- Variational analysis and applications
- Variational analysis of marginal functions with applications to bilevel programming
- Weak linear bilevel programming problems: existence of solutions via a penalty method
Cited in
(3)
This page was built for publication: Duality-based single-level reformulations of bilevel optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998504)