Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292)
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: Faster, but weaker, relaxations for quadratically constrained quadratic programs |
scientific article; zbMATH DE number 6345664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster, but weaker, relaxations for quadratically constrained quadratic programs |
scientific article; zbMATH DE number 6345664 |
Statements
Faster, but weaker, relaxations for quadratically constrained quadratic programs (English)
0 references
18 September 2014
0 references
nonconvex quadratic programming
0 references
semidefinite programming
0 references
second-order cone programming
0 references
difference of convex
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8396723866462708
0 references
0.8353880643844604
0 references
0.8291656970977783
0 references
0.8244808316230774
0 references
