Pages that link to "Item:Q288239"
From MaRDI portal
The following pages link to Heuristics for exact nonnegative matrix factorization (Q288239):
Displaying 9 items.
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- Matrix product constraints by projection methods (Q1675556) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Learning without loss (Q2138443) (← links)
- The NMF problem and lattice-subspaces (Q2185834) (← links)
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
- Extension Complexity of Polytopes with Few Vertices or Facets (Q2835841) (← links)
- Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
