Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/mp/ZhengSL11, #quickstatements; #temporary_batch_1731530891435 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/mp/ZhengSL11 / rank | |||
Normal rank | |||
Revision as of 21:53, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation |
scientific article |
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
