Computing the distance between the linear matrix pencil and the completely positive cone (Q301674)
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: Computing the distance between the linear matrix pencil and the completely positive cone |
scientific article; zbMATH DE number 6600331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the distance between the linear matrix pencil and the completely positive cone |
scientific article; zbMATH DE number 6600331 |
Statements
Computing the distance between the linear matrix pencil and the completely positive cone (English)
0 references
1 July 2016
0 references
completely positive matrices
0 references
CP projection
0 references
linear matrix pencil
0 references
linear optimization with moments
0 references
semidefinite algorithm
0 references
0 references
0 references
0 references
0 references
0.7666200995445251
0 references
0.7497788071632385
0 references
0.7496446967124939
0 references
0.733383297920227
0 references
0.7287984490394592
0 references
