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

Full description

Bibliographic Details

Published in:	Journal of computational and applied mathematics Vol. 429; p. 115215
Main Authors:	Wen, You-Wei, Li, Kexin, Chen, Hefeng
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!