Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5968805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation |
scientific article; zbMATH DE number 5968805 |
Statements
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (English)
0 references
7 November 2011
0 references
quadratically constrained quadratic optimization
0 references
convex relaxation
0 references
matrix cones
0 references
semidefinite optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9645237
0 references
0.9498474
0 references
0.9490665
0 references
0.9452978
0 references
0.9417463
0 references
0.93545276
0 references
0.9339719
0 references
0.9230342
0 references
