Solving ill-posed bilevel programs
From MaRDI portal
Publication:330322
DOI10.1007/s11228-016-0371-xzbMath1362.90346MaRDI QIDQ330322
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
90C26: Nonconvex programming, global optimization
91A65: Hierarchical games (including Stackelberg games)
65K10: Numerical optimization and variational techniques
90C46: Optimality conditions and duality in mathematical programming
90C31: Sensitivity, stability, parametric optimization
Related Items
Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs, Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization, Bilevel Optimization and Variational Analysis, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem, Semivectorial bilevel programming versus scalar bilevel programming, The Standard Pessimistic Bilevel Problem, A bilevel approach to ESG multi-portfolio selection, Convergences for robust bilevel polynomial programmes with applications, Extension of the value function reformulation to multiobjective bilevel optimization, Linearly convergent bilevel optimization with single-step inner methods, Estimates for coderivative of solution map in bilevel program, A bridge between bilevel programs and Nash games, Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches, Further on inner regularizations in bilevel optimization, Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case, Estimates of generalized hessians for optimal value functions in mathematical programming, New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem, Optimality conditions for nonsmooth multiobjective bilevel optimization problems, Numerically tractable optimistic bilevel problems, Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution algorithm for an optimistic linear Stackelberg problem
- Variational analysis of marginal functions with applications to bilevel programming
- Connections between single-level and bilevel multiobjective optimization
- Direct search algorithm for bilevel programming problems
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- On the Newton method for set-valued maps
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Multicriteria approach to bilevel optimization
- Coderivatives of frontier and solution maps in parametric multiobjective optimization
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Generalized differential calculus for nonsmooth and set-valued mappings
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- Bundle trust-region algorithm for bilinear bilevel programming
- Foundations of bilevel programming
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- Weak via strong Stackelberg problem: New results
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- New optimality conditions for the semivectorial bilevel optimization problem
- On solving simple bilevel programs with a nonconvex lower level program
- An overview of bilevel optimization
- Feasible direction method for bilevel programming problem
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Vector Optimization
- Necessary Optimality Conditions for Multiobjective Bilevel Programs
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Bilevel programming with convex lower level problems
- Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
- Variational Analysis in Bilevel Programming
- Existence theorems of equilibrium points in stackelberg
- Generalized equations and their solutions, Part I: Basic theory
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Optimality conditions for bilevel programming problems
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- On the computation of relaxed pessimistic solutions to MPECs
- Necessary optimality conditions in pessimistic bilevel programming
- KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
- Pessimistic Bilevel Optimization
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
