Computing symmetric nonnegative rank factorizations

An algorithm is described for the nonnegative rank factorization (NRF) of some completely positive (CP) matrices whose rank is equal to their CP-rank. The algorithm can compute the symmetric NRF of any nonnegative symmetric rank-r matrix that contains a diagonal principal submatrix of that rank and size with leading cost O(rm2) operations in the dense case. The algorithm is based on geometric considerations and is easy to implement. The implications for matrix graphs are also discussed.


Published in:
Linear Algebra and its Applications, 436, 2, 421-435
Year:
2012
Publisher:
Elsevier
ISSN:
0024-3795
Keywords:
Laboratories:




 Record created 2014-05-14, last modified 2018-03-17

Postprint:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)