【作者单位】a Higher Education Key Laboratory of Engineering and Scientific Computing in Shanxi Province, Taiyuan Normal University, Taiyuan 030012, Shanxi Province, PR China b School of Mathematics Sciences, Taiyuan University of Technology, Jinzhong, 030600, Shanxi Province, PR China
【摘要】 Despite matrix completion requiring the global solution of a non-convex objective, there are many computational efficient algorithms which are effective for a broad class of matrices. Based on these algorithms for matrix completion with given rank pr...
