25 search results - page 2 / 5 » Primal-Dual methods for sparse constrained matrix completion |
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
ICA
2007
Springer
14 years 4 months ago
2007
Springer
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
TKDE
2012
12 years 5 days ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
We propose a sparse non-negative image coding based on simulated annealing and matrix pseudo-inversion. We show that sparsity and non-negativity are both important to obtain part-...
MP
2010
13 years 8 months ago
2010
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...