Solving Euclidean distance matrix completion problems via semidefinite progrmming (Q1294802)
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: Solving Euclidean distance matrix completion problems via semidefinite progrmming |
scientific article; zbMATH DE number 1324689
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Euclidean distance matrix completion problems via semidefinite progrmming |
scientific article; zbMATH DE number 1324689 |
Statements
Solving Euclidean distance matrix completion problems via semidefinite progrmming (English)
0 references
1999
0 references
Euclidean distance matrices
0 references
semidefinite programming
0 references
completion problems
0 references
primal-dual interior-point method
0 references
