Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700)
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: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming |
scientific article; zbMATH DE number 5577760
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming |
scientific article; zbMATH DE number 5577760 |
Statements
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (English)
0 references
13 July 2009
0 references
0 references
0 references
0 references
0 references
0.9427093
0 references
0.93260425
0 references
0.92845964
0 references
0.9270305
0 references
0 references
0.92032385
0 references
0.91981447
0 references
