A matrix A is called completely positive if it can be decomposed as A = BBT with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone which plays a role in certain optimization problems. A characterization of the interior of this cone is provided.
