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

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of computational and applied mathematics Ročník 429; s. 115215
Hlavní autoři:	Wen, You-Wei, Li, Kexin, Chen, Hefeng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.09.2023
Témata:	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
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!