A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
The bilevel problem corresponds to a two-player game in which a leader announces first a strategy \(x\) to minimize his objective function \(F\), and where a follower reacts optimally by selecting a strategy \(y(x)\) to minimize his objective function \(f\). Furthermore, the reaction of the follower to the strategies of the leader is supposed to have no impact on the constraints of the leader. Adopting the Fenchel-Lagrange duality introduced by Bot and Wanka for ordinary convex programming problems, the authors give the so-called Fenchel-Lagrange dual of the bilevel problem. First, they show that a strong duality holds between the two problems. Then, they provide necessary and sufficient optimality conditions for the bilevel problem and its dual. These optimality conditions are given in terms of conjugate functions and subdifferentials, respectively. Finally, the authors show that the resolution of the dual problem is equivalent to the resolution of a one-level convex minimization problem whose objective function is expressed in terms of the conjugates of the functions involved. This approach may give a possibility to solve indirectly the bilevel problem via a one-level convex minimization problem.
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- scientific article; zbMATH DE number 6531256
- Optimality and duality results for bilevel programming problem using convexifactors
- scientific article; zbMATH DE number 1931010
- A duality approach for a class of semivectorial bilevel programming problems
- A simple algorithm for the-linear bilevel programming problem
- A solution method for the linear static Stackelberg problem using penalty functions
- An algorithm for solving two-level convex optimization problems
- Bilevel programs with extremal value function: global optimality
- Conjugate duality for multiobjective composed optimization problems
- Conjugate duality in convex optimization
- Convex Analysis
- Duality in Vector Optimization
- Existence and approximation results involving regularized constrained Stackelberg problems
- Existence theorems of equilibrium points in stackelberg
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- scientific article; zbMATH DE number 3606241 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 2096862 (Why is no real title available?)
- New necessary optimality conditions in optimistic bilevel programming
- On the relations between different duals assigned to composed optimization problems
- Optimality conditions and algorithms for parameter design problems with two-level structure
- Optimality Conditions for Quasi-Differentiable Programs with Application to Two-Level Optimization
- Practical bilevel optimization. Algorithms and applications
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
- scientific article; zbMATH DE number 6531256 (Why is no real title available?)
- Conjugate duality and optimal properties of value-type bilevel linear programming problem
- scientific article; zbMATH DE number 1931010 (Why is no real title available?)
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Sequential Pareto subdifferential multi-composition rule and application to multiobjective minimax location problems
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- scientific article; zbMATH DE number 7668281 (Why is no real title available?)
- Optimality and duality for a weakly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
- A duality approach for a class of semivectorial bilevel programming problems
- Duality for a properly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
This page was built for publication: A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635806)
