12 search results - page 2 / 3 » A nullspace analysis of the nuclear norm heuristic for rank ... |
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
—We present an alternative analysis of weighted 1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matric...
FOCM
2011
12 years 12 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 ...
MP
2011
12 years 11 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
SIAMJO
2011
12 years 7 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
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...