New optimality conditions for bilevel programs by using an exact separation principle (Q2192985)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7238345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New optimality conditions for bilevel programs by using an exact separation principle |
scientific article; zbMATH DE number 7238345 |
Statements
New optimality conditions for bilevel programs by using an exact separation principle (English)
0 references
24 August 2020
0 references
The article is aimed at deriving new optimality conditions for bilevel optimization problems with inequality constraints where a part of the variables belongs to the solution set of a parametric optimization problem formulated for the other variables. It is assumed that the objective and the constraint functions are locally Lipschitz continuous. The authors use the exact separation theorem proved by \textit{X. Y. Zheng} et al. [Optimization 66, No. 7, 1065--1077 (2017; Zbl 1407.90344)] to obtain exact optimality conditions for the bilevel optimization problem under consideration in terms of normal cones to the feasible set, namely the Fréchet normal cone and the Mordukhovich (limiting) normal cones. The new optimality conditions are proved in the form of two theorems, one of which gives a sequential optimality condition without any qualification, and the other -- under a nonsmooth sequentially Abadie constraint qualification. Both conditions are derived in terms of Fréchet subdifferentials of the initial data.
0 references
bilevel optimzation
0 references
compact set
0 references
Fréchet subdifferential
0 references
Fréchet normal cone
0 references
optimality conditions
0 references
0 references
0 references
0.8352276682853699
0 references
0.8285269141197205
0 references
0.826704740524292
0 references
0.8219459652900696
0 references
0.8199490904808044
0 references