Realizability of Polytopes as a Low Rank Matrix Completion Problem.
Michael Gene DobbinsPublished in: Discret. Comput. Geom. (2014)
Keyphrases
- matrix completion
- low rank
- matrix factorization
- convex optimization
- low rank matrix approximation
- linear combination
- missing data
- rank minimization
- high dimensional data
- singular value decomposition
- semi supervised
- low rank matrix
- high order
- kernel matrix
- norm minimization
- low rank matrices
- singular values
- data sets
- trace norm
- minimization problems
- affinity matrix
- missing values
- nuclear norm
- collaborative filtering