Pages that link to "Item:Q651217"
From MaRDI portal
The following pages link to Computing symmetric nonnegative rank factorizations (Q651217):
Displaying 6 items.
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- The NMF problem and lattice-subspaces (Q2185834) (← 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)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
