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...

Celý popis

Podrobná bibliografie

Vydáno v:	Mathematical programming computation Ročník 4; číslo 4; s. 333 - 361
Hlavní autoři:	Wen, Zaiwen, Yin, Wotao, Zhang, Yin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer-Verlag 01.12.2012
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!