Solving ill-posed bilevel programs
From MaRDI portal
Publication:330322
DOI10.1007/S11228-016-0371-XzbMATH Open1362.90346OpenAlexW119503700MaRDI QIDQ330322FDOQ330322
Authors: Alain B. Zemkoho 
Publication date: 25 October 2016
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/373041/1/Solving-Ill-posed.pdf
Recommendations
- Presolving linear bilevel optimization problems
- On the solution of convex bilevel optimization problems
- Numerical solution of a class of bilevel programming problems
- A method for solving bilevel linear programming problems
- A regularization method for ill-posed bilevel optimization problems
- Solving bi-level linear programmes
- Bilevel programming with convex lower level problems
- Efficient solutions for the linear bilevel programming problem
- Solving bilevel linear programs using multiple objective linear programming
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Hierarchical games (including Stackelberg games) (91A65)
Cites Work
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Weak via strong Stackelberg problem: New results
- New optimality conditions for the semivectorial bilevel optimization problem
- An overview of bilevel optimization
- Optimality conditions for the semivectorial bilevel optimization problem
- Existence theorems of equilibrium points in stackelberg
- Variational analysis of marginal functions with applications to bilevel programming
- Title not available (Why is that?)
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Sensitivity analysis for two-level value functions with applications to bilevel programming
- Necessary optimality conditions in pessimistic bilevel programming
- Pessimistic bilevel optimization
- Direct search algorithm for bilevel programming problems
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Generalized differential calculus for nonsmooth and set-valued mappings
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- Vector Optimization
- Necessary optimality conditions for multiobjective bilevel programs
- Solution algorithm for an optimistic linear Stackelberg problem
- Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
- Title not available (Why is that?)
- Generalized equations and their solutions, Part I: Basic theory
- Optimality conditions for bilevel programming problems
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Feasible direction method for bilevel programming problem
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
- Coderivatives of frontier and solution maps in parametric multiobjective optimization
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- Bundle trust-region algorithm for bilinear bilevel programming
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- On solving simple bilevel programs with a nonconvex lower level program
- Stackelberg problems: subgame perfect equilibria via Tikhonov regularization
- Bilevel programming with convex lower level problems
- Variational Analysis in Bilevel Programming
- Title not available (Why is that?)
- Connections between single-level and bilevel multiobjective optimization
- On the computation of relaxed pessimistic solutions to MPECs
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- On the Newton method for set-valued maps
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Multicriteria approach to bilevel optimization
Cited In (31)
- Semivectorial bilevel programming versus scalar bilevel programming
- Extension of the value function reformulation to multiobjective bilevel optimization
- Further on inner regularizations in bilevel optimization
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
- Linearly convergent bilevel optimization with single-step inner methods
- Bilevel programming with discrete lower level problems
- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- A regularization method for ill-posed bilevel optimization problems
- A bilevel approach to ESG multi-portfolio selection
- The standard pessimistic bilevel problem
- New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem
- Estimates for coderivative of solution map in bilevel program
- Numerically tractable optimistic bilevel problems
- Notes on the value function approach to multiobjective bilevel optimization
- A penalty function method for solving ill-posed bilevel programming problem via weighted summation
- Bilevel optimization and variational analysis
- Fuzzy and exact necessary optimality conditions for a nonsmooth bilevel semi-infinite program
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
- Estimates of generalized hessians for optimal value functions in mathematical programming
- Convergences for robust bilevel polynomial programmes with applications
- A new partial cooperation model for ill-posed bilevel programming problems
- A bridge between bilevel programs and Nash games
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
- Risk sharing in equity-linked insurance products: Stackelberg equilibrium between an insurer and a reinsurer
- MPEC methods for bilevel optimization problems
- Inverse demand tracking in transportation networks
- Regularization and approximation methods in Stackelberg games and bilevel optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
This page was built for publication: Solving ill-posed bilevel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330322)
