Fetching the paper…
Reading the bibliography…
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization.
“Robust modeling with erratic data,”
J. F. Claerbout and F. Muir, · 1973
Earlier work this paper cites.
“An iterative technique for absolute deviations curve fitting,”
E. J. Schlossmacher, · 1973
Earlier work this paper cites.
“Robust regression using iteratively reweighted least-squares,”
P. Holland and R. Welsch, · 1977
Earlier work this paper cites.
“Deconvolution with the
H. L. Taylor, S. C. Banks, and J. F. McCoy, · 1979
Earlier work this paper cites.
Robust Statistics
P. J. Huber, · 1981
Earlier work this paper cites.
“Fast algorithms for
R. Yarlagadda, J. B. Bednar, and T. L. Watt, · 1985
Earlier work this paper cites.
“Linear inversion of band-limited reflection seismograms,”
F. Santosa and W. W. Symes, · 1986
Earlier work this paper cites.
“Uncertainty principles and signal recovery,”
D. L. Donoho and P. B. Stark, · 1989
Earlier work this paper cites.
“Signal recovery and the large sieve,”
D. L. Donoho and B. F. Logan, · 1992
Earlier work this paper cites.
“Nonlinear total variation based noise removal algorithms,”
L. I. Rudin, S. Osher, and E. Fatemi, · 1992
Earlier work this paper cites.
Control of Uncertain Systems: A Linear Programming Approach
M. Dahleh and I. Diaz-Bobillo, · 1995
Earlier work this paper cites.
“Regression shrinkage and selection via the lasso,”
R. Tibshirani, · 1996
Earlier work this paper cites.
“A new algorithm for computing sparse solutions to linear inverse problems,”
G. Harikumar and Y. Bresler, · 1996
Earlier work this paper cites.
“Optimal wire and transistor sizing for circuits with non-tree topology,”
L. Vandenberghe, S. Boyd, and A. El Gamal, · 1997
Earlier work this paper cites.
“Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm,”
I. F. Gorodnitsky and B. D. Rao, · 1997
Earlier work this paper cites.
“Atomic decomposition by basis pursuit,”
S. Chen, D. Donoho, and M. Saunders, · 1998
Earlier work this paper cites.
“Color TV: total variation methods for restoration of vector-valued images,”
P. Blomgren and T. F. Chan, · 1998
Earlier work this paper cites.
“Optimizing dominant time constant in RC circuits,”
L. Vandenberghe, S. Boyd, and A. El Gamal, · 1998
Cited alongside, same era.
“Globally convergent edge-preserving regularized reconstruction: An application to limited-angle tomography,”
A. H. Delaney and Y. Bresler, · 1998
Cited alongside, same era.
“Low-authority controller design via convex optimization,”
A. Hassibi, J. How, and S. Boyd, · 1999
Cited alongside, same era.
“Uncertainty principles and ideal atomic decomposition,”
D. L. Donoho and X. Huo, · 2001
Cited alongside, same era.
“A generalized uncertainty principle and sparse representation in pairs of bases,”
M. Elad and A. M. Bruckstein, · 2002
Cited alongside, same era.
“Sparse representations in unions of bases,”
R. Gribonval and M. Nielsen, · 2003
Cited alongside, same era.
“Just relax: Just relax: convex programming methods for identifying sparse signals in noise,”
J. A. Tropp, · 2006
Later among the works it cites.
“Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,”
E. J. Candès, J. Romberg, and T. Tao, · 2006
Later among the works it cites.
“Near optimal signal recovery from random projections: Universal encoding strategies?,”
E. J. Candès and T. Tao, · 2006
Later among the works it cites.
“Compressed sensing,”
D. Donoho, · 2006
Later among the works it cites.
“Counting faces of randomly-projected polytopes when then projection radically lowers dimension,”
D. L. Donoho and J. Tanner, · 2006
Later among the works it cites.
“Stable signal recovery from incomplete and inaccurate measurements,”
E. J. Candès, J. Romberg, and T. Tao, · 2006
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices,”
M. Fazel, H. Hindi, and S. Boyd, · 2003
Cited alongside, same era.
Convex Optimization
S. Boyd and L. Vandenberghe, · 2004
Cited alongside, same era.
Optimization
K. Lange, · 2004
Cited alongside, same era.
“Redundant multiscale transforms and their application for morphological component analysis,”
J.-L. Starck, M. Elad, and D. L. Donoho, · 2004
Cited alongside, same era.
“Decoding by linear programming,”
E. J. Candès and T. Tao, · 2005
Cited alongside, same era.
“Analog-to-Information (A-to-I),”
D. L. Healy (Program Manager), · 2005
Cited alongside, same era.
Later among the works it cites.
“Extensions of compressed sensing,”
D. Donoho and Y. Tsaig, · 2006
Later among the works it cites.
“A compressed sensing camera: New theory and an implementation using digital micromirrors,”
D. Takhar, V. Bansal, M. Wakin, M. Duarte, D. Baron, K. F. Kelly, and R. G. Baraniuk, · 2006
Later among the works it cites.
“Highly robust error correction by convex programming,”
E. J. Candès and P. A. Randall, · 2006
Later among the works it cites.
“Compressive wireless sensing,”
W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak, · 2006
Later among the works it cites.
“The Dantzig selector: Statistical estimation when
E. J. Candès and T. Tao, · 2006
Later among the works it cites.
“Sparse MRI: The application of compressed sensing for rapid MR imaging,”
M. Lustig, D. Donoho, and J. M. Pauly, · 2007
Closest in time.
“Portfolio optimization with linear and fixed transaction costs,”
M. S. Lobo, M. Fazel, and S. Boyd, · 2007
Closest in time.
“Exact reconstruction of sparse signals via nonconvex minimization,”
R. Chartrand, · 2007
Closest in time.
“Analysis versus synthesis in signal priors,”
M. Elad, P. Milanfar, and R. Rubinstein, · 2007
Closest in time.
“Lecture notes for EE364B: Convex Optimization II,” 2007,
S. Boyd, · 2007
Closest in time.