Abstract: We consider the matrix completion problem for special classes of matrices. This includes EDM, low rank, robust PCA, and Toeplitz. We consider both the exact and noisy cases. We include theoretical results as well as efficient numerical techniques. Our tools are semidefinite programming, facial reduction, and trust region subproblems.