A new linear convergence result for the iterative soft thresholding algorithm

References

• Candès E, Tao T. Decoding by linear programming. IEEE Trans Inform Theory. 2005;51:4203–4215.
   Web of Science ®Google Scholar
• Combettes PL, Wajs VR. Signal recovery by proximal forward-backward splitting. Multiscale Model Sim. 2005;4:1168–1200.
   Web of Science ®Google Scholar
• Donoho DL. Compressed sensing. IEEE Trans Inform Theory. 2006;52:1289–1306.
   Web of Science ®Google Scholar
• Beck A, Teboulle M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci. 2009;2:183–202.
   Web of Science ®Google Scholar
• Bredies K, Lorenz DA. Iterated hard shrinkage for minimization problems with sparsity constraints. SIAM J Sci Comput. 2008;30:657–683.
   Web of Science ®Google Scholar
• Elad M. Sparse and redundant representations. New York(NY): Springer; 2010.
   Google Scholar
• Qin J, Hu Y, Xu F, et al. Inferring gene regulatory networks by integrating ChIP-seq/chip and transcriptome data via LASSO-type regularization methods. Methods. 2014;67:294–303.
   PubMed Web of Science ®Google Scholar
• Simon N, Friedman J, Hastie T, et al. A sparse-group Lasso. J Comput Graph Stat. 2013;22:231–245.
   Web of Science ®Google Scholar
• Wang J, Hu Y, Li C, et al. Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Probl. 2017;33055017.
   Web of Science ®Google Scholar
• Bach F, Jenatton R, Mairal J, et al. Structured sparsity through convex optimization. Stat Sci. 2012;27:450–468.
   Web of Science ®Google Scholar
• Hu Y, Li C, Meng K, et al. Group sparse optimization via lp,q regularization. J Mach Learn Res. 2017;18:1–52.
   Web of Science ®Google Scholar
• Mairal J. Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J Optim. 2015;25:829–855.
   Web of Science ®Google Scholar
• Bazavan EG, Li F, Sminchisescu C. Fourier kernel learning. In: Fitzgibbon A, Lazebnik S, Perona P, et al., editors. Proceedings of 12th European Conference on Computer Vision. Berlin: Springer; 2012. p. 459–473.
   Google Scholar
• Bredies K, Lorenz DA. Linear convergence of iterative soft-thresholding. J Fourier Anal Appl. 2008;14:813–837.
   Web of Science ®Google Scholar
• Donoho DL. Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition. Appl Comput Harmon Anal. 1995;2:101–126.
   Web of Science ®Google Scholar
• Gribonval R, Nielsen M. Highly sparse representations from dictionaries are unique and independent of the sparseness measure. Appl Comput Harmon Anal. 2007;22:335–355.
   Web of Science ®Google Scholar
• Figueiredo MAT, Nowak RD, Wright SJ. Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J Sel Top Signa. 2007;1:586–597.
   Web of Science ®Google Scholar
• He B, Yuan X. On the O(1/n) convergence rate of the Douglas-Rachford alternating direction method. SIAM J Numer Anal. 2012;50:700–709.
   Web of Science ®Google Scholar
• Hu Y, Li C, Yang X. On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J Optim. 2016;26:1207–1235.
   Web of Science ®Google Scholar
• Lu Z, Xiao L. On the complexity analysis of randomized block-coordinate descent methods. Math Program. 2015;152:615–642.
   Web of Science ®Google Scholar
• Nesterov Y. Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J Optim. 2012;22:341–362.
   Web of Science ®Google Scholar
• Xiao L, Zhang T. A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J Optim. 2013;23:1062–1091.
   Web of Science ®Google Scholar
• Yang J, Zhang Y. Alternating direction algorithms for ll-problems in compressive sensing. SIAM J Sci Comput. 2011;33:250–278.
   Web of Science ®Google Scholar
• Figueiredo MAT, Nowak RD. An EM algorithm for wavelet-based image restoration. IEEE Trans Image Process. 2003;12:906–916.
   PubMed Web of Science ®Google Scholar
• Starck JL, Nguyen MK, Murtagh F. Wavelets and curvelets for image deconvolution: a combined approach. Signal Process. 2003;83:2279–2283.
   Web of Science ®Google Scholar
• Daubechies I, Defrise M, Mol CD. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun Pure Appl Math. 2004;57:1413–1457.
   Web of Science ®Google Scholar
• Bect J, Blanc-Fèraud L, Aubert G, et al. A l1 unified variational framework for image restoration. In: Pajdla T, Matas J, editors. Proceedings of Eighth European Conference on Computer Vision. Berlin: Springer; 2004. p. 1–13.
   Google Scholar
• Hale ET, Yin W, Zhang Y. Fixed-point continuation for l1-minimization: methodology and convergence. SIAM J Optim. 2009;19:1107–1130.
   Web of Science ®Google Scholar
• Tao S, Boley D, Zhang S. Local linear convergence of ISTA and FISTA on the LASSO problem. SIAM J Optim. 2016;26:313–336.
   Web of Science ®Google Scholar
• Nesterov Y. Gradient methods for minimizing composite functions. Math Program. 2013;140:125–161.
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. New York (NY): Springer; 2011.
   Google Scholar
• Rockafellar RT. Convex analysis. Princeton: Princeton University Press; 1970.
   Google Scholar