ICASSP
2011
IEEE
13 years 4 months ago
2011
IEEE
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
JMLR
2010
13 years 7 months ago
2010
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
FFA
2007
14 years 11 days ago
2007
In this paper we construct some algebraic geometric error-correcting codes on surfaces whose Neron-Severi group has low rank. If the rank of the Neron-Severi group is 1, the inters...
SDM
2007
SIAM
14 years 1 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
IFIP
2005
Springer
14 years 6 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
SCIA
2009
Springer
14 years 7 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...