Accelerated matrix completion algorithm using continuation strategy and randomized SVD

The matrix completion (MC) problem aims to recover the complete matrix from the observed matrix with missing entries. The unknown matrix is generally assumed to have a low-rank structure. It is well known that the low-rank minimization problem is NP-hard, so the rank function of the matrix is approx...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computational and applied mathematics Jg. 429; S. 115215
Hauptverfasser:	Wen, You-Wei, Li, Kexin, Chen, Hefeng
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.09.2023
Schlagworte:	Alternating minimization Continuation strategy Matrix completion Non-convex surrogate Randomized singular value decomposition Alternating minimization Randomized singular value decomposition Non-convex surrogate Continuation strategy Matrix completion
ISSN:	0377-0427
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!