Some properties of the bilevel programming problem
Journal of Optimization Theory and Applications
On subdifferential of optimal value functions
SIAM Journal on Control and Optimization
Necessary optimality conditions for Stackelberg problems
Journal of Optimization Theory and Applications
Approximations and metric regularity in mathematical programming in Banach space
Mathematics of Operations Research
Necessary Conditions for Bilevel Dynamic Optimization Problems
SIAM Journal on Control and Optimization
First-order necessary optimality conditions for general bilevel programming problems
Journal of Optimization Theory and Applications
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
SIAM Journal on Control and Optimization
Nonsmooth calculus, minimality, and monotonicity of convexificators
Journal of Optimization Theory and Applications
A Multivariate Partition Approach to Optimization Problems
Cybernetics and Systems Analysis
Hunting for a Smaller Convex Subdifferential
Journal of Global Optimization
On the Regularity Condition for Vector Programming Problems
Journal of Global Optimization
A review of recent advances in global optimization
Journal of Global Optimization
Second order optimality conditions for bilevel set optimization problems
Journal of Global Optimization
Hi-index | 0.00 |
In this work, we use a notion of convexificator (Jeyakumar, V. and Luc, D.T. (1999), Journal of Optimization Theory and Applicatons, 101, 599---621.) to establish necessary optimality conditions for bilevel optimization problems. For this end, we introduce an appropriate regularity condition to help us discern the Lagrange---Kuhn---Tucker multipliers.