Linearized Bregman iterations for compressed sensing

Mathematics of Computation

Volumn 78, Issue 267, 2009, Pages 1515-1536

  Cai, Jian Feng ^a   Osher, Stanley ^b   Shen, Zuowei ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67349244805     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-08-02189-3     Document Type: Article

References (35)

1. L. M. Brégman, A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming, Z.̌ Vyčisl. Mat. i Mat. Fiz. 7 (1967), 620-631. MR0215617 (35:6457)
2. A. M. Bruckstein, D. L. Donoho, and M. Elad, From sparse solutions of systems of equations to sparse modeling of signals and images, 2008, to appear in SIAM Review.
3. J.-F. Cai, R. H. Chan, L. Shen, and Z. Shen, Restoration of chopped and nodded images by framelets, SIAM J. Sci. Comput. 30 (2008), no. 3, 1205-1227.
4. J.-F. Cai, R. H. Chan, L. Shen, and Z. Shen, Simultaneously inpainting in image and transformed domains, 2008, preprint.
5. J.-F. Cai, R. H. Chan, and Z. Shen, A framelet-based image inpainting algorithm, Appl. Comput. Harmon. Anal. 24 (2008), no. 2, 131-149. MR2393979
6. J.-F. Cai, R. H. Chan, and Z. Shen, Simultaneous cartoon and texture inpainting, 2008, preprint.
7. J.-F. Cai and Z. Shen, Deconvolution: A wavelet frame approach, II, 2008, preprint.
8. E. Candés and J. Romberg, Sparsity and incoherence in compressive sampling, Inverse Problems 23 (2007), no. 3, 969-985. MR2329927
9. E. J. Candés, Compressive sampling, International Congress of Mathematicians. Vol. III, Eur. Math. Soc., Z̈urich, 2006, pp. 1433-1452. MR2275736
10. E. J. Candés and J. Romberg, Quantitative robust uncertainty principles and optimally sparse decompositions, Found. Comput. Math. 6 (2006), no. 2, 227-254. MR2228740 (2007a:94035)
11. E. J. Candés, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory 52 (2006), no. 2, 489-509. MR2236170 (2007e:94020)
12. E. J. Candes and T. Tao, Near-optimal signal recovery from random projections: Universal encoding strategies?, IEEE Trans. Inform. Theory 52 (2006), no. 12, 5406-5425. MR2300700
13. A. Chai and Z. Shen, Deconvolution: A wavelet frame approach, Numer. Math. 106 (2007), no. 4, 529-587. MR2317925
14. P. L. Combettes and J.-C. Pesquet, Proximal thresholding algorithm for minimization over orthonormal bases, SIAM J. Opt. 18 (2007), no. 4, 1351-1376 (electronic). MR2373305
15. P. L. Combettes and V. R. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Model. Simul. 4 (2005), no. 4, 1168-1200 (electronic). MR2203849
16. J. Darbon and S. Osher, Fast discrete optimization for sparse approximations and deconvolutions, 2007, preprint.
17. I. Daubechies, M. Defrise, and C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Comm. Pure Appl. Math. 57 (2004), no. 11, 1413-1457. MR2077704 (2005k:65106)
18. I. Daubechies, G. Teschke, and L. Vese, Iteratively solving linear inverse problems under general convex constraints, Inverse Probl. Imaging 1 (2007), no. 1, 29-46. MR2262744
19. R. A. DeVore, Deterministic constructions of compressed sensing matrices, J. Complexity 23 (2007), 918-925. MR2371999
20. D. L. Donoho, De-noising by soft-thresholding, IEEE Trans. Inform. Theory 41 (1995), no. 3, 613-627. MR1331258 (96b:94002)
21. D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory 52 (2006), no. 4, 1289-1306. MR2241189 (2007e:94013)
22. D. L. Donoho and J. Tanner, Neighborliness of randomly projected simplices in high dimensions, Proc. Natl. Acad. Sci. USA 102 (2005), no. 27, 9452-9457 (electronic). MR2168716
23. M. Elad and A. M. Bruckstein, A generalized uncertainty principle and sparse representation in pairs of bases, IEEE Trans. Inform. Theory 48 (2002), no. 9, 2558-2567. MR1929464 (2003h:15002)
24. A. Feuer and A. Nemirovski, On sparse representation in pairs of bases, IEEE Trans. Inform. Theory 49 (2003), no. 6, 1579-1581. MR1984950 (2004d:42051)
25. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex analysis and minimization algorithms. I, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 305, Springer-Verlag, Berlin, 1993, Fundamentals. MR1261420 (95m:90001)
26. P. J. Huber, Robust regression: Asymptotics, conjectures and Monte Carlo, Ann. Statist. 1 (1973), 799-821. MR0356373 (50:8843)
27. S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, An iterative regularization method for total variation-based image restoration, Multiscale Model. Simul. 4 (2005), no. 2, 460-489 (electronic). MR2162864 (2006c:49051)
28. S. Osher, Y. Mao, B. Dong, and W. Yin, Fast linearized Bregman iteration for compressed sensing and sparse denoising, 2008, UCLA CAM Reports (08-37).
29. M. Rudelson and R. Vershynin, Geometric approach to error-correcting codes and reconstruction of signals, Int. Math. Res. Not. (2005), no. 64, 4019-4041. MR2206919 (2006j:94116)
30. J. A. Tropp, Just relax: Convex programming methods for identifying sparse signals in noise, IEEE Trans. Inform. Theory 52 (2006), no. 3, 1030-1051. MR2238069 (2007a:94064)
31. Y. Tsaig and D. L. Donono, Extensions of compressed sensing, Signal Processing 86 (2005), 533-548.
32. 1- minimization with applications to compressed sensing, SIAM J. Imaging Sci. 1 (2008), no. 1, 143-168.
33. 1-minimization: Go over or under?, 2005, Rice University CAAM Technical Report TR05-09.
34. Y. Zhang, When is missing data recoverable?, 2006, Rice University CAAM Technical Report TR06-15.
35. H. Zou and T. Hastie, Regularization and variable selection via the elastic net, J. R. Stat. Soc. Ser. B Stat. Methodol. 67 (2005), no. 2, 301-320. MR2137327