Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857): Difference between revisions
From MaRDI portal
Latest revision as of 18:03, 22 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures |
scientific article |
Statements
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (English)
0 references
26 May 2020
0 references
equivalence of doubly nonnegative relaxations and completely positive programs
0 references
sparsity of completely positive reformulations
0 references
aggregate and correlative sparsity
0 references
block-clique graphs
0 references
completely positive and doubly nonnegative matrix completion
0 references
exact optimal values of nonconvex QOPs
0 references
0 references
0 references
0 references
0 references
