Solving bilevel programming problem by a non-interior point homotopy method (Q3385152)
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: Solving bilevel programming problem by a non-interior point homotopy method |
scientific article; zbMATH DE number 7448217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving bilevel programming problem by a non-interior point homotopy method |
scientific article; zbMATH DE number 7448217 |
Statements
17 December 2021
0 references
bilevel programming problem
0 references
non-interior point homotopy method
0 references
normal cone condition
0 references
global convergence
0 references
0.8989115357398987
0 references
0.8225495219230652
0 references
0.8107776045799255
0 references
0.8010744452476501
0 references
0.7985848784446716
0 references
