Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix. In this paper, we solve the EDMCP by generalizing the completion problem to allow for approximate completions. In particular, we introduce a primal–dual interior-point algorithm that solves an equivalent (quadratic objective function) semidefinite programming problem. Numerical results are included which illustrate the efficiency and robustness of our approach. Our randomly generated problems consistently resulted in low dimensional solutions when no completion existed.
