Bilevel convex programming models
From MaRDI portal
Publication:3648626
DOI10.1080/02331930701763330zbMath1175.90313OpenAlexW2058437939MaRDI QIDQ3648626
Sanjo Zlobec, R. Trujillo Cortez
Publication date: 27 November 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701763330
lower semicontinuityparametersaddle pointoptimal value functionglobal and local optimumbilevel convex programmesmarginal value formula
Related Items
The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set ⋮ Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems ⋮ A projection and contraction method with adaptive step sizes for solving bilevel pseudo-monotone variational inequality problems ⋮ Projection and contraction methods for solving bilevel pseudomonotone variational inequalities ⋮ Convergence theorems for variational inequalities on the solution set of Ky Fan inequalities ⋮ Inertial extrapolation method with regularization for solving a new class of bilevel problem in real Hilbert spaces ⋮ An inertial projection and contraction method for solving bilevel quasimonotone variational inequality problems ⋮ A strong convergence of modified subgradient extragradient method for solving bilevel pseudomonotone variational inequality problems ⋮ Proximal subgradient algorithm for a class of nonconvex bilevel equilibrium problems ⋮ Relaxed single projection methods for solving bilevel variational inequality problems in Hilbert spaces ⋮ Subgradient projection methods extended to monotone bilevel equilibrium problems in Hilbert spaces ⋮ A projection method for bilevel variational inequalities ⋮ Strong convergence theorem for the lexicographic Ky Fan inequality ⋮ Strong convergence of extragradient methods for solving bilevel pseudo-monotone variational inequality problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- A theoretical approximation scheme for Stackelberg problems
- Characterizing optimality in mathematical programming models
- Convex two-level optimization
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- Optimality conditions for the bilevel programming problem
- A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- The marginal value formula in input optimization
- A necessary and a sufficient optimality condition for bilevel programming problems
- A practicable way for computing the directional derivative of the optimal value function in convex programming
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Optimality conditions for bilevel programming problems
- Computing optimal incentives via bilevel programming
- Stability in linear programming models: An index set approach
This page was built for publication: Bilevel convex programming models
