THE CP MATRIX APPROXIMATION PROBLEM

symmetric matrix A is completely positive (CP) if there exists an entrywise nonnegative matrix V such that A = V V T . In this paper, we study the CP-matrix approximation problem of projecting a matrix onto the intersection of a set of linear constraints and the cone of CP matrices. We formulate the