搜索结果: 1-1 共查到“几何学 Convex Relaxation”相关记录1条 . 查询时间(0.019 秒)
The Power of Convex Relaxation:Near-Optimal Matrix Completion
Matrix completion low-rank matrices semidefinite programming duality in optimization nuclear norm minimization random matrices and techniques from random matrix theory free probability
2015/6/17
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applica...