On a solving bilevel d.c.-convex optimization problems (Q4965111)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a solving bilevel d.c.-convex optimization problems |
scientific article; zbMATH DE number 7315681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a solving bilevel d.c.-convex optimization problems |
scientific article; zbMATH DE number 7315681 |
Statements
On a Solving Bilevel D.C.-Convex Optimization Problems (English)
0 references
25 February 2021
0 references
bilevel optimization
0 references
optimistic solution
0 references
KKT-approach
0 references
reduction theorem
0 references
difference of two convex functions
0 references
d.c. optimization
0 references
global search theory
0 references
exact penalty theory
0 references
local search
0 references
0 references
0 references
0.8480227589607239
0 references
0.830289900302887
0 references
0.8249019384384155
0 references
0.8197459578514099
0 references
0.8149510622024536
0 references
