Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming

• 1 January 1999
• journal article
• research article
• Published by Springer Nature in Computational Optimization and Applications
• Vol. 12  (1/3) , 13-30
• https://doi.org/10.1023/A:1008655427845

Abstract

Keywords

• EUCLIDEAN DISTANCE MATRICES
• SEMIDEFINITE PROGRAMMING
• COMPLETION PROBLEMS
• PRIMAL-DUAL INTERIOR-POINT METHOD