Normalized Iterative Hard Thresholding for Matrix Completion

Matrices of low rank can be uniquely determined from fewer linear measurements, or entries, than the total number of entries in the matrix. Moreover, there is a growing literature of computationally efficient algorithms which can recover a low rank matrix from such limited information; this process...

Full description

Bibliographic Details

Published in:	SIAM journal on scientific computing Vol. 35; no. 5; pp. S104 - S125
Main Authors:	Tanner, Jared, Wei, Ke
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Subjects:	Adaptive algorithms Algorithms Applied mathematics Computational efficiency Extreme values Iterative methods Masks Mathematical analysis Projection
ISSN:	1064-8275, 1095-7197
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!