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 interested in using robust Gaussian function to solve the low-rank matrix completion problem, which is the special case of the rank minimization problem. This regularized problem is a differential smooth convex optimizatio… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.