An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix (Q3352373)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4203580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix |
scientific article; zbMATH DE number 4203580 |
Statements
An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix (English)
0 references
1990
0 references
alternating projection algorithm
0 references
least squares problems
0 references
matrix cones
0 references
normal cones
0 references
multidimensional scaling
0 references
smallest perturbation
0 references
Euclidean distance matrices
0 references
0.8248108625411987
0 references
0.8233276605606079
0 references
0.8102255463600159
0 references
