A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
A matrix A is called completely positive if it can be decomposed as A = BB T 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.doi:10.13001/1081-3810.1248 fatcat:eyafzo6e6vgfjgvvuhfo7jm2kq