Geometry of low nonnegative rank matrix completion
From MaRDI portal
Cites work
- A note on nonnegative rank factorizations
- A Singular Value Thresholding Algorithm for Matrix Completion
- Algebraic matroids in action
- An alternating direction algorithm for matrix completion with nonnegative factors
- An efficient method for non-negative low-rank completion
- Completion of tree metrics and rank 2 matrices
- Computing nonnegative rank factorizations
- Finding minimal convex nested polygons
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Homomorphisms between stochastic sequential machines and related problems
- scientific article; zbMATH DE number 4107004 (Why is no real title available?)
- Lifts of Convex Sets and Cone Factorizations
- Matrix completion for the independence model
- Matrix Completion From a Few Entries
- Nonnegative low rank matrix approximation for nonnegative matrices
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- On the complexity of nonnegative matrix factorization
- On the geometric interpretation of the nonnegative rank
- Rank factorizations of positive operators
- Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
- Results on the algebraic matroid of the determinantal variety
- Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes
- The algebraic combinatorial approach for low-rank matrix completion
- The geometry of rank-one tensor completion
- The nonnegative rank factorizations of nonnegative matrices
- Uniqueness of low-rank matrix completion by rigidity theory
- Why Are Big Data Matrices Approximately Low Rank?
This page was built for publication: Geometry of low nonnegative rank matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285443)
