${\mathcal{\ell }}_{1-2}$ Regularization for Sparse Optimization: Consistency and Global Convergence

References

• [1] Bach FR (2008) Consistency of trace norm minimization. J. Machine Learn. Res. 8(35):1019–1048.Google Scholar
• [2] Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1):183–202.Crossref, Google Scholar
• [3] Bickel PJ, Ritov Y, Tsybakov AB (2009) Simultaneous analysis of Lasso and Dantzig selector. Ann. Statist. 37(4):1705–1732.Crossref, Google Scholar
• [4] Blanchard JD, Cartis C, Tanner J (2011) Compressed sensing: How sharp is the restricted isometry property? SIAM Rev. 53(1):105–125.Crossref, Google Scholar
• [5] Blumensath T, Davies ME (2009) Iterative hard thresholding for compressed sensing. Appl. Comput. Harmononic Anal. 27(3):265–274.Crossref, Google Scholar
• [6] Bunea F, Tsybakov A, Wegkamp M (2007) Sparsity oracle inequalities for the Lasso. Electronic J. Statist. 1:169–194.Crossref, Google Scholar
• [7] Candès E, Tao T (2005) Decoding by linear programming. IEEE Trans. Inform Theory 51(12):4203–4215.Crossref, Google Scholar
• [8] Candès E, Romberg JK, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59(8):1207–1223.Crossref, Google Scholar
• [9] Chen X, Xu F, Ye Y (2010) Lower bound theory of nonzero entries in solutions of ℓ2-ℓp minimization. SIAM J. Sci. Comput. 32(5):2832–2852.Crossref, Google Scholar
• [10] Daubechies I, Defrise M, De Mol C (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math. 57(11):1413–1457.Crossref, Google Scholar
• [11] Donoho DL (2006) For most large underdetermined systems of linear equations the minimal ℓ1-norm solution is also the sparsest solution. Comm. Pure Appl. Math. 59(6):797–829.Crossref, Google Scholar
• [12] Donoho DL, Huo XM (2001) Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform Theory 47(7):2845–2862.Crossref, Google Scholar
• [13] Esser E, Lou Y, Xin J (2013) A method for finding structured sparse solutions to nonnegative least squares problems with applications. SIAM J. Imaging Sci. 6(4):2010–2046.Crossref, Google Scholar
• [14] Fan J, Li R (2001) Variable selection via nonconcave penalized likelihood and its oracle properties. J. Amer. Statist. Assoc. 96(456):1348–1360.Crossref, Google Scholar
• [15] Foucart S, Rauhut H (2013) A Mathematical Introduction to Compressive Sensing (Springer, New York).Crossref, Google Scholar
• [16] Ge H, Wen J, Chen W (2018) The null space property of the truncated ℓ1-2-minimization. IEEE Signal Processing Lett. 25(8):1261–1265.Crossref, Google Scholar
• [17] Hale ET, Yin W, Zhang Y (2008) Fixed-point continuation for ℓ1-minimization: Methodology and convergence. SIAM J. Optim. 19(3):1107–1130.Crossref, Google Scholar
• [18] Hastie T, Tibshirani R, Wainwright M (2015) Statistical Learning with Sparsity: The Lasso and Generalizations (CRC Press, Boca Raton, FL).Crossref, Google Scholar
• [19] Hu Y, Hu X, Yang X (2025) On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization. Math. Programming 211:181–206.Crossref, Google Scholar
• [20] Hu Y, Li C, Meng K, Qin J, Yang X (2017) Group sparse optimization via ℓp,q regularization. J. Machine Learn. Res. 18(30):1–52.Google Scholar
• [21] Jiao Y, Jin B, Lu X (2017) Iterative soft/hard thresholding with homotopy continuation for sparse recovery. IEEE Signal Processing Lett. 24(6):784–788.Crossref, Google Scholar
• [22] Li X, Hu Y, Li C, Yang X, Jiang T (2023) Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression. J. Global Optim. 85:315–349.Crossref, Google Scholar
• [23] Lou Y, Yan M (2018) Fast L1-L2 minimization via a proximal operator. J. Sci. Comput. 74:767–785.Crossref, Google Scholar
• [24] Lou Y, Yin P, Xin J (2016) Point source super-resolution via non-convex l1 based methods. J. Sci. Comput. 68:1082–1100.Crossref, Google Scholar
• [25] Lou Y, Yin P, He Q, Xin J (2015a) Computing sparse representation in a highly coherent dictionary based on difference of l1 and l2. J. Sci. Comput. 64:178–196.Crossref, Google Scholar
• [26] Lou Y, Zeng T, Osher S, Xin J (2015b) A weighted difference of anisotropic and isotropic total variation model for image processing. SIAM J. Imaging Sci. 8(3):1798–1823.Crossref, Google Scholar
• [27] Ma TH, Lou Y, Huang TZ (2017) Truncated l1−2 models for sparse recovery and rank minimization. SIAM J. Imaging Sci. 10(3):1346–1380.Crossref, Google Scholar
• [28] Meinshausen N, Yu B (2009) Lasso-type recovery of sparse representations for high-dimensional data. Ann. Statist. 37(1):246–270.Crossref, Google Scholar
• [29] Natarajan B (1995) Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2):227–234.Crossref, Google Scholar
• [30] Needell D, Tropp J (2009) CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmonic Anal. 26(3):301–321.Crossref, Google Scholar
• [31] Negahban SN, Ravikumar P, Wainwright MJ, Yu B (2012) A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers. Statist. Sci. 27(4):538–557.Crossref, Google Scholar
• [32] Shen J, Li P (2018) A tight bound of hard thresholding. J. Machine Learn. Res. 18(208):1–42.Google Scholar
• [33] Tropp JA (2004) Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50(10):2231–2242.Crossref, Google Scholar
• [34] van de Geer SA, Bühlmann P (2009) On the conditions used to prove oracle results for the Lasso. Electronic J. Statist. 3:1360–1392.Crossref, Google Scholar
• [35] van den Berg E, Friedlander MP (2008) Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2):890–912.Crossref, Google Scholar
• [36] Wen Z, Yin W, Goldfarb D, Zhang Y (2010) A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32(4):1832–1857.Crossref, Google Scholar
• [37] Wright SJ (2015) Coordinate descent algorithms. Math. Programming 151(1):3–34.Crossref, Google Scholar
• [38] Xiao L, Zhang T (2013) A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J. Optim. 23(2):1062–1091.Crossref, Google Scholar
• [39] Xu Z, Chang X, Xu F, Zhang H (2012) L1/2 regularization: A thresholding representation theory and a fast solver. IEEE Trans. Neural Networks Learn. Systems 23(7):1013–1027.Crossref, Google Scholar
• [40] Yang J, Zhang Y (2011) Alternating direction algorithms for ℓ1-problems in compressive sensing. SIAM J. Sci. Comput. 33(1):250–278.Crossref, Google Scholar
• [41] Yin W, Osher S, Goldfarb D (2008) Bregman iterative algorithms for ℓ1-minimization with application to compressed sensing. SIAM J. Imaging Sci. 1(1):143–168.Crossref, Google Scholar
• [42] Yin P, Lou Y, He Q, Xin J (2015) Minimization of ℓ1-2 for compressed sensing. SIAM J. Sci. Comput. 37(1):A536–A563.Crossref, Google Scholar
• [43] Zhang CH (2010) Nearly unbiased variable selection under minimax concave penalty. Ann. Statist. 38(2):894–942.Crossref, Google Scholar
• [44] Zhang C, Zhang T (2012) A general theory of concave regularization for high-dimensional sparse estimation problems. Statist. Sci. 27(4):576–593.Crossref, Google Scholar
• [45] Zhang J, Zhang S (2021) Null space property of ℓ1-2 minimization with prior support information. IEEE Signal Processing Lett. 28:1779–1783.Crossref, Google Scholar
• [46] Zhao YB (2020) Optimal k-thresholding algorithms for sparse optimization problems. SIAM J. Optim. 30(1):31–55.Crossref, Google Scholar
• [47] Zhao P, Yu B (2006) On model selection consistency of Lasso. J. Machine Learn. Res. 7(A.11):2541–2563.Google Scholar