Structure method for solving the nearest Euclidean distance matrix problem

被引:0
作者
Suliman Al-Homidan
机构
[1] King Fahd University of Petroleum and Minerals,Department of Mathematics and Statistics
来源
Journal of Inequalities and Applications | / 2014卷
关键词
Euclidean distance matrix; positive semidefinite matrix; Newton method; BFGS method;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
相关论文
共 50 条
[21]   Computing the nearest correlation matrix - a problem from finance [J].
Higham, NJ .
IMA JOURNAL OF NUMERICAL ANALYSIS, 2002, 22 (03) :329-343
[22]   COMPUTING A NEAREST CORRELATION MATRIX WITH FACTOR STRUCTURE [J].
Borsdorf, Ruediger ;
Higham, Nicholas J. ;
Raydan, Marcos .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2010, 31 (05) :2603-2622
[23]   Spatial Sound Localization via Multipath Euclidean Distance Matrix Recovery [J].
Taghizadeh, Mohammad Javad ;
Asaei, Afsaneh ;
Haghighatshoar, Saeid ;
Garner, Philip N. ;
Bourlard, Herve .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2015, 9 (05) :802-814
[24]   Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints [J].
Si-Tong Lu ;
Miao Zhang ;
Qing-Na Li .
Computational Optimization and Applications, 2020, 76 :535-569
[25]   Euclidean Distance Matrix-Based Rapid Fault Detection and Exclusion [J].
Knowles, Derek ;
Gao, Grace .
NAVIGATION-JOURNAL OF THE INSTITUTE OF NAVIGATION, 2023, 70 (01)
[26]   CONSTRAINED BEST EUCLIDEAN DISTANCE EMBEDDING ON A SPHERE: A MATRIX OPTIMIZATION APPROACH [J].
Bai, Shuanghua ;
Qi, Huo-Duo ;
Xiu, Naihua .
SIAM JOURNAL ON OPTIMIZATION, 2015, 25 (01) :439-467
[27]   Command Coordination in Multi-agent Formation: Euclidean Distance Matrix Approaches [J].
Ahn, Hyo-Sung ;
Oh, Kwang-Kyo .
INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS (ICCAS 2010), 2010, :1592-1597
[28]   A Study of Euclidean Distance Matrix Computation on Intel Many-Core Processors [J].
Rechkalov, Timofey ;
Zymbler, Mikhail .
PARALLEL COMPUTATIONAL TECHNOLOGIES, PCT 2018, 2018, 910 :200-215
[29]   A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix [J].
Nilson J. M. Moreira ;
Leonardo T. Duarte ;
Carlile Lavor ;
Cristiano Torezzan .
Computational and Applied Mathematics, 2018, 37 :4989-4999
[30]   A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix [J].
Moreira, Nilson J. M. ;
Duarte, Leonardo T. ;
Lavor, Carlile ;
Torezzan, Cristiano .
COMPUTATIONAL & APPLIED MATHEMATICS, 2018, 37 (04) :4989-4999