Subspace Pursuit for Compressive Sensing Signal Reconstruction

Y. Han, , C. Hartmann, and C.-C. Chen, “Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes,” IEEE Trans. on Information Theory , vol. 51, pp. 1514–1523, 1993

1993

Earlier work this paper cites.

I. E. Nesterov, A. Nemirovskii, and Y. Nesterov, Interior-Point Polynomial Algorithms in Convex Programming . SIAM, 1994

1994

Earlier work this paper cites.

Å. Björck, Numerical Methods for Least Squares Problems . SIAM, 1996

1996

Earlier work this paper cites.

R. Venkataramani and Y. Bresler, “Sub-nyquist sampling of multiband signals: perfect reconstruction and bounds on aliasing error,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , vol. 3, 12-15 May Seattle, WA, 1998, pp. 1633–1636 vol.3

1998

Earlier work this paper cites.

J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Trans. Inform. Theory , vol. 50, no. 10, pp. 2231–2242, 2004

2004

Earlier work this paper cites.

R. S. Varga, Geršgorin and His Circles . Berlin: Springer-Verlag, 2004

2004

Earlier work this paper cites.

D. Needell and R. Vershynin, “Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit,” preprint, 2008

Original

2004

Earlier work this paper cites.

E. Candès and T. Tao, “Decoding by linear programming,” Information Theory, IEEE Transactions on , vol. 51, no. 12, pp. 4203–4215, 2005

2005

Cited alongside, same era.

E. Candès, R. Mark, T. Tao, and R. Vershynin, “Error correction via linear programming,” in IEEE Symposium on Foundations of Computer Science (FOCS) , 2005, pp. 295 – 308

2005

Cited alongside, same era.

D. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory , vol. 52, no. 4, pp. 1289–1306, 2006

2006

Cited alongside, same era.

E. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory , vol. 52, no. 2, pp. 489–509, 2006

2006

Cited alongside, same era.

G. Cormode and S. Muthukrishnan, “Combinatorial algorithms for compressed sensing,” in Proceedings of the 40th Annual Conference on Information Sciences and Systems , 2006

D. Needell and R. Vershynin, “Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit,” preprint, 2007

2007

Later among the works it cites.

S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, “A method for large-scale ℓ 1 \ell_{1} -regularized least squares,” IEEE Journal on Selected Topics in Signal Processing , vol. 1, no. 4, pp. 606–617, December 2007

2007

Later among the works it cites.

P. Tseng and S. Yun, “A coordinate gradient descent method for nonsmooth separable minimization,” Mathematical Programming , vol. 117, no. 1-2, pp. 387–423, August, 2007

2007

Later among the works it cites.

A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin, “One sketch for all: Fast algorithms for compressed sensing,” in Symp. on Theory of Computing (STOC) , San Diego, CA, June, 2007

2007

Later among the works it cites.