8 search results - page 1 / 2 » The power of convex relaxation: near-optimal matrix completi... |
TIT
2010
12 years 11 months ago
2010
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 gr...
SIAMJO
2010
13 years 3 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
FOCM
2011
12 years 11 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
JMLR
2010
12 years 11 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...