We consider the problem of minimizing the spectral condition number of a positive definite matrix by completion: [GRAPHICS] where A is an n x n Hermitian positive definite matrix, B a p x n matrix and X is a free p x p Hermitian matrix. We reduce this problem to an optimization problem for a convex function in one variable. Using the minimal solution of this problem we characterize the complete set of matrices that give the minimum condition number.