89 search results - page 9 / 18 » Sparse Recovery by Non-convex Optimization -- Instance Optim... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This article presents novel results concerning the recovery of signals from undersampled data in the common situation where such signals are not sparse in an orthonormal basis or ...
IPCO
2008
13 years 9 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
ICA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper, a new algorithm for source recovery in underdetermined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented i...
SIAMJO
2011
12 years 10 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...