Matrix Completion Using Graph Total Variation Based on Directed Laplacian Matrix

We propose two graph matrix completion algorithms called GMCM-DL and GMCR-DL, by employing a new definition of Graph Total Variation for matrices based on the directed Laplacian Matrix. We show that these algorithms outperform their peers in terms of RMSEs for both cases of uniform and row observations.