We investigate the problem of robust matrix completion with a fraction of observation corrupted by sparsity outlier noise.We propose an algorithmic framework based on the ADMM algorithm for a non-convex optimization,whose objective function consists of an e1 norm data fidelity and a rank constraint.To reduce the computational cost per iteration,two inexact schemes are developed to replace the most time-consuming step in the generic ADMM algorithm.The resulting algorithms remarkably outperform the existing solvers for robust matrix completion with outlier noise.When the noise is severe and the underlying matrix is ill-conditioned,the proposed algorithms are faster and give more accurate solutions than state-of-the-art robust matrix completion approaches.