A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274)
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: A computational study for bilevel quadratic programs using semidefinite relaxations |
scientific article; zbMATH DE number 6636438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational study for bilevel quadratic programs using semidefinite relaxations |
scientific article; zbMATH DE number 6636438 |
Statements
A computational study for bilevel quadratic programs using semidefinite relaxations (English)
0 references
7 October 2016
0 references
conic programming and interior point methods
0 references
bilevel programming
0 references
semidefinite programming
0 references
mixed integer linear programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8244706392288208
0 references
0.8032445311546326
0 references
0.7839556932449341
0 references
0.7696371078491211
0 references
0.7672981023788452
0 references
