most citedFast and Near-Optimal Matrix Completion via Randomized Basis Pursuit

11 citations · 11 across the 1 of their papers we have counts for

collaborators

1 paper

cs.IT2009★ 11 cited

Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit

Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye

Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recentl…