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.
CITATION STYLE
Dür, M., & Still, G. (2008). Interior points of the completely positive cone. Electronic Journal of Linear Algebra, 17, 48–53. https://doi.org/10.13001/1081-3810.1248
Mendeley helps you to discover research relevant for your work.