Matrix completion algorithms with optimal phase transition

We present new first order algorithm for matrix completion and show by numerical tests that they are able to recover rank r matrices of size m × n from only Const. · (m + n − r)r entries with Const. close to one. This evidence shows that matrix completion is achieved closer to the oracle limit than in compressed sensing.