Deterministic Polynomial Time Algorithms for Matrix Completion Problems.

Gábor Ivanyos Marek Karpinski Nitin Saxena

Published in: SIAM J. Comput. (2010)

Keyphrases

matrix completion
optimization problems
low rank matrix approximation
computational complexity
worst case
low rank
theoretical guarantees
optimization methods
learning algorithm
social networks
evolutionary algorithm
nearest neighbor
principal component analysis
higher order