Fetching the paper…
Reading the bibliography…
L1-minimization refers to finding the minimum L1-norm solution to an underdetermined linear system b=Ax.
K. Frisch, “The logarithmic potential method of convex programming,” University Institute of Economics (Oslo, Norway), Tech. Rep., 1955
1955
Earlier work this paper cites.
D. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods . Athena Scientific, 1982
1982
Earlier work this paper cites.
Y. Nesterov, “A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) (1/k^{2})
1983
Earlier work this paper cites.
N. Karmarkar, “A new polynomial time algorithm for linear programming,” Combinatorica , vol. 4, pp. 373–395, 1984
1984
Earlier work this paper cites.
J. Barzilai and J. Borwein, “Two point step size gradient methods,” IMA Journal of Numerical Analysis , vol. 8, pp. 141–148, 1988
1988
Earlier work this paper cites.
N. Megiddo, “Pathways to the optimal set in linear programming,” in Progress in Mathematical Programming: Interior-Point and Related Methods , 1989, pp. 131–158
1989
Earlier work this paper cites.
R. Monteiro and I. Adler, “Interior path following primal-dual algorithms. Part I: Linear programming,” Mathematical Programming , vol. 44, pp. 27–41, 1989
1989
Earlier work this paper cites.
M. Kojima, N. Megiddo, and S. Mizuno, “Theoretical convergence of large-step primal-dual interior point algorithms for linear programming,” Mathematical Programming , vol. 59, pp. 1–21, 1993
1993
Earlier work this paper cites.
C. Kelley, Iterative methods for linear and nonlinear equations . Philadelphia: SIAM, 1995
1995
Earlier work this paper cites.
G. Davis, S. Mallat, and M. Avellaneda, “Adaptive greedy approximations,” Journal of Constructive Approximation , vol. 13, pp. 57–98, 1997
1997
Earlier work this paper cites.
P. Belhumeur, J. Hespanda, and D. Kriegman, “Eigenfaces vs. Fisherfaces: recognition using class specific linear projection,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 19, no. 7, pp. 711–720, 1997
1997
Earlier work this paper cites.
M. Osborne, B. Presnell, and B. Turlach, “A new approach to variable selection in least squares problems,” IMA Journal of Numerical Analysis , vol. 20, pp. 389–404, 2000
2000
Earlier work this paper cites.
S. Chen, D. Donoho, and M. Saunders, “Atomic decomposition by basis pursuit,” SIAM Review , vol. 43, no. 1, pp. 129–159, 2001
2001
Earlier work this paper cites.
F. Kschischang, B. Frey, and H. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory , vol. 47, no. 2, pp. 498–519, 2001
2001
Earlier work this paper cites.
R. Basri and D. Jacobs, “Lambertian reflectance and linear subspaces,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 25, no. 2, pp. 218–233, 2003
2003
Earlier work this paper cites.
D. P. Bertsekas, Nonlinear Programming . Athena Scientific, 2003
2003
Earlier work this paper cites.
J. Tropp, “Greed is good: Algorithmic results for sparse approximation,” IEEE Transactions on Information Theory , vol. 50, no. 10, pp. 2231–2242, 2004
2004
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge University Press, 2004
2004
Earlier work this paper cites.
B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, “Least angle regression,” The Annals of Statistics , vol. 32, no. 2, pp. 407–499, 2004
2004
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Communications on Pure and Applied Math , vol. 57, pp. 1413–1457, 2004
2004
Earlier work this paper cites.
D. Baron, M. Wakin, M. Duarte, S. Sarvotham, and R. Baraniuk, “Distributed compressed sensing,” preprint , 2005
2005
Earlier work this paper cites.
D. Malioutov, M. Cetin, and A. Willsky, “Homotopy continuation for sparse signal representation,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing , 2005
2005
Earlier work this paper cites.
P. Combettes and V. Wajs, “Signal recovery by proximal forward-backward splitting,” SIAM Multiscale Modeling and Simulation , vol. 4, pp. 1168–1200, 2005
2005
Earlier work this paper cites.
E. Candès, “Compressive sampling,” in Proceedings of the International Congress of Mathematicians , 2006
2006
Cited alongside, same era.
D. Donoho, “For most large underdetermined systems of linear equations the minimal ℓ 1 \ell^{1} -norm near solution approximates the sparest solution,” Communications on Pure and Applied Mathematics , vol. 59, no. 7, pp. 907–934, 2006
2006
Cited alongside, same era.
E. Candès, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Math , vol. 59, no. 8, pp. 1207–1223, 2006
2006
Cited alongside, same era.
J. Nocedal and S. Wright, Numerical Optimization , 2nd ed. New York: Springer, 2006
2006
Cited alongside, same era.
D. Donoho and Y. Tsaig, “Fast solution of ℓ 1 \ell^{1} -norm minimization problems when the solution may be sparse,” preprint
2006
S. Becker, J. Bobin, and E. Candes, “NESTA: a fast and accurate first-order method for sparse recovery,” preprint , 2009
2009
Later among the works it cites.
D. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” PNAS , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
Later among the works it cites.
2009
Later among the works it cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Later among the works it cites.
W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing signal reconstruction,” IEEE Transactions on Information Theory , vol. 55, no. 5, pp. 2230–2249, 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A. Auslender and M. Teboulle, “Interior gradient and proximal methods for convex and conic optimization,” SIAM Journal on Optimization , vol. 16, no. 3, pp. 697–725, 2006
2006
Cited alongside, same era.
M. Elad, B. Matalon, and M. Zibulevskyb, “Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization,” Applied and Computational Harmonic Analysis , vol. 23, no. 3, pp. 346 – 367, 2007
2007
Cited alongside, same era.
M. Figueiredo, R. Nowak, and S. Wright, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE Journal of Selected Topics in Signal Processing , vol. 1, no. 4, pp. 586–597, 2007
2007
Cited alongside, same era.
S. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, “An interior-point method for large-scale ℓ 1 \ell_{1} -regularized least squares,” IEEE Journal of Selected Topics in Signal Processing , vol. 1, no. 4, pp. 606–617, 2007
2007
Cited alongside, same era.
E. Hale, W. Yin, and Y. Zhang, “A fixed-point continuation method for ℓ 1 \ell^{1} -regularized minimization with applications to compressed sensing,” Rice University, Houston, TX, Tech. Rep. CAAM Technical Report TR07-07, 2007
2007
Cited alongside, same era.
Y. Nesterov, “Gradient methods for minimizing composite objective function,” ECORE Discussion Paper , 2007
2007
Cited alongside, same era.
J. Yang, J. Wright, T. Huang, and Y. Ma, “Image super-resolution as sparse representation of raw image patches,” in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition , 2008
2008
Cited alongside, same era.
2009
Later among the works it cites.
T. Goldstein and S. Osher, “The split bregman method for l1-regularized problems,” SIAM J. Imaging Sciences , vol. 2, no. 2, pp. 323–343, 2009
2009
Later among the works it cites.
A. Yang, A. Ganesh, S. Sastry, and Y. Ma, “Fast ℓ 1 \ell_{1} -minimization algorithms and an application in robust face recognition: a review,” in Proceedings of the International Conference on Image Processing , 2010
2010
Closest in time.
J. F. Gemmeke, H. V. Hamme, B. Cranen, and L. Boves, “Compressive sensing for missing data imputation in noise robust speech recognition,” J. Sel. Topics Signal Processing , vol. 4, no. 2, pp. 272–287, 2010
2010
Closest in time.
A. Yang, M. Gastpar, R. Bajcsy, and S. Sastry, “Distributed sensor perception via sparse representation,” Proceedings of the IEEE , vol. 98, no. 6, pp. 1077–1088, 2010
2010
Closest in time.
J. Wright, Y. Ma, J. Mairal, G. Sapiro, T. Huang, and S. Yan, “Sparse representation for computer vision and pattern recognition,” Proceedings of the IEEE , vol. 98, no. 6, pp. 1031–1044, 2010
2010
Closest in time.
M. Zibulevskyb and M. Elad, “L1-L2 optimization in signal and image processing,” IEEE Signal Processing Magazine , vol. 27, no. 3, pp. 76 – 88, 2010
2010
Closest in time.
S. R. Becker, E. J. Candès, and M. Grant, “Templates for Convex Cone Problems with Applications to Sparse Signal Recovery,” ArXiv e-prints , 2010
2010
Closest in time.
M. V. Afonso, J. M. Bioucas-Dias, and M. A. T. Figueiredo, “Fast image recovery using variable splitting and constrained optimization,” IEEE Transactions on Image Processing , vol. 19, no. 9, pp. 2345 – 2356, 2010
2010
Closest in time.
J. Friedman, T. Hastie, and R. Tibshirani, “Regularization paths for generalized linear models via coordinate descent,” Journal of Statistical Software , vol. 33, no. 1, pp. 1–22, 2010
2010
Closest in time.
J. Tropp and S. Wright, “Computational methods for sparse solution of linear inverse problems,” Proceedings of the IEEE , vol. 98, pp. 948–958, 2010
2010
Closest in time.
J. Wright and Y. Ma, “Dense error correction via ℓ 1 \ell^{1} -minimization,” IEEE Transactions on Information Theory , vol. 56, no. 7, pp. 3540–3560, 2010
2010
Closest in time.
D. Baron, S. Sarvotham, and R. Baraniuk, “Bayesian compressive sensing via belief propagation,” IEEE Transactions on Signal Processing , vol. 58, no. 1, pp. 269–280, 2010
2010
Closest in time.
L. Zhang, M. Yang, and X. Feng, “Sparse representation or collaborative representation: Which helps face recognition?” in Proceedings of the IEEE International Conference on Computer Vision , 2011
2011
Closest in time.
2011
Closest in time.
W. W. Hager, D. T. Phan, and H. Zhang, “Gradient-based methods for sparse recovery,” SIAM J. Imaging Sciences , vol. 4, no. 1, pp. 146–165, 2011
2011
Closest in time.
M. V. Afonso, J. M. Bioucas-Dias, and M. A. T. Figueiredo, “An augmented lagrangian approach to the constrained optimization formulation of imaging inverse problems,” IEEE Transactions on Image Processing , vol. 20, no. 3, pp. 681 – 695, 2011
2011
Closest in time.
V. Shia, A. Yang, and S. Sastry, “Fast ℓ 1 \ell_{1} -minimization and algorithm parallelization for face recognition,” in Asilomar Conference on Signals, Systems and Computers , 2011
2011
Closest in time.