An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix (Q3352373): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0611042 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000389722 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:01, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix |
scientific article |
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
