Dynamic updating for L1 minimization

  title={Dynamic updating for L1 minimization},
  author={Muhammad Salman Asif and Justin K. Romberg},
  journal={J. Sel. Topics Signal Processing},
The theory of compressive sensing (CS) has shown us that under certain conditions, a sparse signal can be recovered from a small number of linear incoherent measurements. An effective class of reconstruction algorithms involve solving a convex optimization program that balances the 1 norm of the solution against a data fidelity term. Tremendous progress has been made in recent years on algorithms for solving these 1 minimization programs. These algorithms, however, are for the most part static… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 34 extracted citations

57 Citations

Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 37 references

The DASSO algorithm for fitting the Dantzig selector and the Lasso

  • G James, P Radchenko, J Lv
  • Journal of the Royal Statistical Society, Series…
  • 2009
1 Excerpt

Primal Dual Pursuit: A homotopy based algorithm for the Dantzig selector

  • M S Asif
  • Primal Dual Pursuit: A homotopy based algorithm…
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…