On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (Q3169131): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:38, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming |
scientific article |
Statements
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (English)
0 references
27 April 2011
0 references
semidefinite programming relaxations
0 references
quadratic matrix programming
0 references
quadratic constrained quadratic programming
0 references
hard combinatorial problems
0 references
sparsity patterns
0 references
