Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

The matrix completion problem is to recover a low-rank matrix from a subset of its entries. The main solution strategy for this problem has been based on nuclear-norm minimization which requires computing singular value decompositions—a task that is increasingly costly as matrix sizes and ranks incr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical programming computation Jg. 4; H. 4; S. 333 - 361
Hauptverfasser:	Wen, Zaiwen, Yin, Wotao, Zhang, Yin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer-Verlag 01.12.2012
Schlagworte:	Full Length Paper Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Optimization Theory of Computation 65K05 90C06 Alternating minimization Nonlinear GS method 93C41 68Q32 Nonlinear SOR method Matrix completion
ISSN:	1867-2949, 1867-2957
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!