Back to Search
Start Over
Structure method for solving the nearest Euclidean distance matrix problem.
- Source :
-
Journal of Inequalities & Applications . Dec2014, Vol. 2014, p1-7. 7p. - Publication Year :
- 2014
-
Abstract
- A matrix with zero diagonal is called a Euclidean distance matrix when the matrix values are measurements of distances between points in a Euclidean space. Because of data errors such a matrix may not be exactly Euclidean and it is desirable in many applications to find the best Euclidean matrix which approximates the non-Euclidean matrix. In this paper the problem is formulated as a smooth unconstrained minimization problem, for which rapid convergence can be obtained. Comparative numerical results are reported. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10255834
- Volume :
- 2014
- Database :
- Academic Search Index
- Journal :
- Journal of Inequalities & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 102079476
- Full Text :
- https://doi.org/10.1186/1029-242X-2014-491