Pages that link to "Item:Q651217"

The following pages link to Computing symmetric nonnegative rank factorizations (Q651217):

Displaying 16 items.

• A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
• On nonnegative factorization of matrices (Q580478) (← links)
• Symmetry-based matrix factorization (Q597055) (← links)
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices (Q703624) (← links)
• Computing a nearest symmetric positive semidefinite matrix (Q1105980) (← links)
• Building a completely positive factorization (Q1787912) (← links)
• The NMF problem and lattice-subspaces (Q2185834) (← links)
• Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications (Q2189661) (← links)
• Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962) (← links)
• Methods for nonnegative matrix factorization based on low-rank cross approximations (Q2278210) (← links)
• An efficient method for computing the inverse of arrowhead matrices (Q2349233) (← links)
• Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method (Q2376864) (← links)
• Symmetric nonnegative matrix trifactorization (Q2693700) (← links)
• Symmetric rank revealing factorizations (Q2751275) (← links)
• (Q3495475) (← links)
• Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)