File Exchange

image thumbnail

Matrix Completion via Thresholding

version 1.0 (4.61 KB) by

Convex, Non-convex and NP hard matrix completion algorithms



View License

Contains three matrix completion algorithms and a demo script for running them. Also compares against other matrix completion algorithms - Singular Value Thresholding and Fixed Point Iteration.
Solves the following three optimization problems:
min rank(X) subject to ||y - M(X)||_2<err via Iterated Hard Thresholding
min nuclear-norm(X) subject to ||y - M(X)||_2<err via Iterated Soft Thresholding
min ||S||_p subject to ||y - M(X)||_2<err, where S = svd(X) via Iterated Soft Thresholding
Requires Sparco since the masking operator has been defined in according to the Sparco framework.
The algorithms are general enough to work with any other linear operator, and not only the masking operator. The masking operator is just a special case when the problem boils down to one of matrix completion.
For comparing the results with other algorithms download the Singular Value Thresholding toolbox

Comments and Ratings (6)


Many thanks for your contribution! A quick question: Would it be possible to constrain matrix elements to [a, b] interval?

quang nguyen

chenhong yang

Janki Mehta

Anton Semechko

Anton Semechko (view profile)


MATLAB Release
MATLAB 7.8 (R2009a)

Download apps, toolboxes, and other File Exchange content using Add-On Explorer in MATLAB.

» Watch video