25 search results - page 3 / 5 » Primal-Dual methods for sparse constrained matrix completion |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
SIGIR
2012
ACM
12 years 6 days ago
2012
ACM
In crowdsourced relevance judging, each crowd worker typically judges only a small number of examples, yielding a sparse and imbalanced set of judgments in which relatively few wo...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Recent results on the control of linear systems subject to time-domain constraints could only handle the case of closed-loop poles that are situated on the real axis. As most c...