Structure method for solving the nearest Euclidean distance matrix problem

Journal of inequalities and applications

Suliman Al-Homidan¹ 

关键词: Euclidean distance matrix;    positive semidefinite matrix;    Newton method;    BFGS method;   

DOI  :  10.1186/1029-242X-2014-491

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

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.

【 授权许可】

CC BY