The CP-matrix completion problem (Q2877082)
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: The CP-matrix completion problem |
scientific article; zbMATH DE number 6333363
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The CP-matrix completion problem |
scientific article; zbMATH DE number 6333363 |
Statements
21 August 2014
0 references
completely positive (CP) matrices
0 references
matrix completion
0 references
E-matrices
0 references
E-truncated \(\Delta\)-moment problem
0 references
semidefinite program
0 references
The CP-matrix completion problem (English)
0 references
After an introduction of truncated moment problems, the authors present a semidefinite algorithm for solving general CP-completion problems. Its basic properties are also studied. Further, properties of CP-completion problems when some diagonal entries are missing are analyzed. Computational results along with some applications are also given.
0 references
