Robust Gaussian FunctionAlgorithm forMatrix Completion
Published in International Journal of Signal Processing Image Processing and Pattern Recognition • Apr 30, 2016
Authors:,,
Juan Geng
Mengxuan Zhao
Cuiping Nie
Abstract
This paper introduces a novel algorithm to solve the matrix rank minimization problem among all matrices obeying a set of convex constraints. The most popular convex relaxation of the rank minimization problem minimizes the nuclear norm instead of the rank of the matrix. In this paper we are interes...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!