Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
From MaRDI portal
Publication:2342953
DOI10.1007/s10898-014-0200-4zbMath1344.90055MaRDI QIDQ2342953
Publication date: 30 April 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0200-4
Related Items
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem, Optimality conditions of a set valued optimization problem with the help of directional convexificators, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, On variational inequalities using directional convexificators, Directional Necessary Optimality Conditions for Bilevel Programs, Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators, Applying directional upper semi-regular convexificators in bilevel optimization, An investigation of the optimistic solution to the linear trilevel programming problem, Optimality conditions for MPECs in terms of directional upper convexifactors, On the solution of convex bilevel optimization problems, Variational inequalities characterizing weak minimality in set optimization, Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Convexifactors, generalized convexity, and optimality conditions
- Necessary optimality conditions for bilevel set optimization problems
- Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
- On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Practical bilevel optimization. Algorithms and applications
- Necessary optimality conditions for Stackelberg problems
- Hunting for a smaller convex subdifferential
- Multilevel optimization: algorithms and applications
- Second order optimality conditions for the extremal problem under inclusion constraints
- Foundations of bilevel programming
- On the variational principle
- On the regularity condition for vector programming problems
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Nonsmooth vector functions and continuous optimization
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Set-relations and optimality conditions in set-valued maps
- Convexity and Optimization in Banach Spaces
- On Subdifferentials of Optimal Value Functions
- Bilevel programming with convex lower level problems
- On Optimization Problems with Variational Inequality Constraints
- Problems of Hierarchical Optimization in Finite Dimensions
- A necessary and a sufficient optimality condition for bilevel programming problems
- Optimality conditions for bilevel programming problems
- KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
- New necessary optimality conditions in optimistic bilevel programming
