Complexity of the positive semidefinite matrix completion problem with a rank constraint (Q2848995)
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: Complexity of the positive semidefinite matrix completion problem with a rank constraint |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the positive semidefinite matrix completion problem with a rank constraint |
scientific article |
Statements
Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (English)
0 references
13 September 2013
0 references
elliptope
0 references
correlation matrix
0 references
psd matrix completion
0 references
0 references
0.7893253564834595
0 references
0.7869808077812195
0 references
0.7751144170761108
0 references
0.7579165101051331
0 references
