Deterministic Polynomial Time Algorithms for Matrix Completion Problems

Gábor Ivanyos Marek Karpinski Nitin Saxena

Published in: CoRR (2009)

Keyphrases

matrix completion
low rank
optimization problems
learning algorithm
low rank matrix approximation
computational complexity
worst case
optimization methods
theoretical guarantees
pairwise
linear combination
convex relaxation