Solving Euclidean distance matrix completion problems via semidefinite progrmming (Q1294802): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:51, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Euclidean distance matrix completion problems via semidefinite progrmming |
scientific article |
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
