Nonconvex matrix completion with Nesterov’s acceleration

Nonconvex matrix completion with Nesterov’s acceleration

Abstract Background In matrix completion fields, the traditional convex regularization may fall short of delivering reliable low-rank estimators with good prediction performance. Previous works use the alternation least squares algorithm to optimize the nonconvex regularization. However, this algori...

Full description

Bibliographic Details
Main Authors: Xiao-Bo Jin, Guo-Sen Xie, Qiu-Feng Wang, Guoqiang Zhong, Guang-Gang Geng
Format: Article
Language:English
Published: BMC 2018-12-01
Series:Big Data Analytics
Subjects:
Matrix completion
Nonconvex optimization
Randomized SVD
Nesterov’s momentum
Online Access:http://link.springer.com/article/10.1186/s41044-018-0037-9

Internet

http://link.springer.com/article/10.1186/s41044-018-0037-9

Similar Items