期刊
MATHEMATICAL PROGRAMMING COMPUTATION
卷 4, 期 4, 页码 333-361出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s12532-012-0044-1
关键词
Matrix completion; Alternating minimization; Nonlinear GS method; Nonlinear SOR method
类别
资金
- NSF through UCLA IPAM [DMS-0439872]
- NSFC [11101274]
- NSF CAREER Award [DMS-07-48839]
- ONR [N00014-08-1-1101]
- Alfred P. Sloan Research Fellowship
- NSF [DMS-0405831, DMS-0811188]
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [1115950] Funding Source: National Science Foundation
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 nuclearnorm minimization which requires computing singular value decompositions-a task that is increasingly costly as matrix sizes and ranks increase. To improve the capacity of solving large-scale problems, we propose a low-rank factorization model and construct a nonlinear successive over-relaxation (SOR) algorithm that only requires solving a linear least squares problem per iteration. Extensive numerical experiments show that the algorithm can reliably solve a wide range of problems at a speed at least several times faster than many nuclear-norm minimization algorithms. In addition, convergence of this nonlinear SOR algorithm to a stationary point is analyzed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据