A Singular Value Thresholding Algorithm for Matrix Completion

Abstract

This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of recovering a large matrix from a small subset of its entries… (More)
DOI: 10.1137/080738970

Topics

7 Figures and Tables

Statistics

020040060020082009201020112012201320142015201620172018
Citations per Year

2,842 Citations

Semantic Scholar estimates that this publication has 2,842 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics