{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:16:26Z","timestamp":1770815786236,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s40314-024-02962-6","type":"journal-article","created":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T12:02:39Z","timestamp":1729512159000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0482-1650","authenticated-orcid":false,"given":"Lie-Jun","family":"Xie","sequence":"first","affiliation":[]},{"given":"Wen","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"issue":"3","key":"2962_CR1","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.sigpro.2011.09.017","volume":"92","author":"T Blumensath","year":"2012","unstructured":"Blumensath T (2012) Accelerated iterative hard thresholding. Signal Process 92(3):752\u2013756. https:\/\/doi.org\/10.1016\/j.sigpro.2011.09.017","journal-title":"Signal Process"},{"issue":"6","key":"2962_CR2","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.1109\/TIT.2013.2245716","volume":"59","author":"T Blumensath","year":"2013","unstructured":"Blumensath T (2013) Compressed sensing with nonlinear observations and related nonlinear optimization problems. IEEE Trans Inf Theory 59(6):3466\u20133474. https:\/\/doi.org\/10.1109\/TIT.2013.2245716","journal-title":"IEEE Trans Inf Theory"},{"key":"2962_CR3","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath T, Davies ME (2008) Iterative threshloding for sparse approxiamtions. J Fourier Anal Appl 14:629\u2013654. https:\/\/doi.org\/10.1007\/s00041-008-9035-z","journal-title":"J Fourier Anal Appl"},{"issue":"3","key":"2962_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath T, Davies ME (2009) Iterative hard threshloding for compressed sensing. Appl Comput Harmon Anal 27(3):265\u2013274. https:\/\/doi.org\/10.1016\/j.acha.2009.04.002","journal-title":"Appl Comput Harmon Anal"},{"issue":"11","key":"2962_CR5","doi-asserted-by":"publisher","first-page":"4333","DOI":"10.1109\/TSP.2009.2025088","volume":"57","author":"T Blumensath","year":"2009","unstructured":"Blumensath T, Davies ME (2009) Stagewise weak grdient pursuit. IEEE Trans Signal Process 57(11):4333\u20134346. https:\/\/doi.org\/10.1109\/TSP.2009.2025088","journal-title":"IEEE Trans Signal Process"},{"issue":"2","key":"2962_CR6","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath T, Davies ME (2010) Normalized iterative hard threshloding: guaranteed stability and performance. IEEE J Sel Top Signal Process 4(2):298\u2013309. https:\/\/doi.org\/10.1109\/JSTSP.2010.2042411","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"2","key":"2962_CR7","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.acha.2016.03.002","volume":"41","author":"JL Bouchot","year":"2016","unstructured":"Bouchot JL, Foucart S, Hitczenko P (2016) Hard thresholding pursuit algorithms: number of iterations. Appl Comput Harmon Anal 41(2):412\u2013435. https:\/\/doi.org\/10.1016\/j.acha.2016.03.002","journal-title":"Appl Comput Harmon Anal"},{"key":"2962_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.acha.2021.10.002","volume":"56","author":"JF Cai","year":"2022","unstructured":"Cai JF, Li J, Lu X, You J (2022) Sparse signal recovery from phaseless measurements via hard thresholding pursuit. Appl Comput Harmon Anal 56:367\u2013390. https:\/\/doi.org\/10.1016\/j.acha.2021.10.002","journal-title":"Appl Comput Harmon Anal"},{"issue":"12","key":"2962_CR9","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215. https:\/\/doi.org\/10.1109\/TIT.2005.858979","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"2962_CR10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e9s","year":"2006","unstructured":"Cand\u00e9s EJ, Romberg JK, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inform Theory 52(2):489\u2013509. https:\/\/doi.org\/10.1109\/TIT.2005.862083","journal-title":"IEEE Trans Inform Theory"},{"key":"2962_CR11","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.5705\/ss.202016.0103","volume":"28","author":"A Carpentier","year":"2018","unstructured":"Carpentier A, Kim A (2018) An iterative hard thresholding estimator for low rank matrix recovery with explicit limiting distribution. Stat Sin 28:1371\u20131393. https:\/\/doi.org\/10.5705\/ss.202016.0103","journal-title":"Stat Sin"},{"issue":"10","key":"2962_CR12","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand R (2007) Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process Lett 14(10):707\u2013710. https:\/\/doi.org\/10.1109\/LSP.2007.898300","journal-title":"IEEE Signal Process Lett"},{"issue":"3","key":"2962_CR13","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/24\/3\/035020","volume":"24","author":"R Chartrand","year":"2008","unstructured":"Chartrand R, Staneva V (2008) Restricted isometry properties and nonconvex compressive sensing. Inverse Probl 24(3):035,020. https:\/\/doi.org\/10.1088\/0266-5611\/24\/3\/035020","journal-title":"Inverse Probl"},{"issue":"5","key":"2962_CR14","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai W, Milenkovic O (2009) Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inform Theory 55(5):2230\u20132249. https:\/\/doi.org\/10.1109\/TIT.2009.2016006","journal-title":"IEEE Trans Inform Theory"},{"issue":"11","key":"2962_CR15","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies I, Defrise M, De Mol C (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun Pure Appl Math 57(11):1413\u20131457. https:\/\/doi.org\/10.1002\/cpa.20042","journal-title":"Commun Pure Appl Math"},{"issue":"3","key":"2962_CR16","doi-asserted-by":"publisher","first-page":"A860","DOI":"10.1137\/16m1062089","volume":"39","author":"JH de Morais Goulart","year":"2017","unstructured":"de Morais Goulart JH, Favier G (2017) Low-rank tensor recovery using sequentially optimal modal projections in iterative hard thresholding (sempiht). SIAM J Sci Comput 39(3):A860\u2013A889. https:\/\/doi.org\/10.1137\/16m1062089","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"2962_CR17","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho DL (1995) De-noising by soft-thresholding. IEEE Trans Inform Theory 41(3):613\u2013627. https:\/\/doi.org\/10.1109\/18.382009","journal-title":"IEEE Trans Inform Theory"},{"issue":"4","key":"2962_CR18","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) Compressed sensing. IEEE Trans Inform Theory 52(4):1289\u20131306. https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Trans Inform Theory"},{"issue":"3","key":"2962_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1093\/biomet\/81.3.425","volume":"81","author":"DL Donoho","year":"1994","unstructured":"Donoho DL, Johnstone IM (1994) Ideal spatial adaptation by wavelet shrinkage. Biometrika 81(3):425\u2013455. https:\/\/doi.org\/10.1093\/biomet\/81.3.425","journal-title":"Biometrika"},{"issue":"2","key":"2962_CR20","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/TIT.2011.217324","volume":"58","author":"DL Donoho","year":"2012","unstructured":"Donoho DL, Tsaig Y, Drori I (2012) Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit. IEEE Trans Inform Theory 58(2):1094\u20131121. https:\/\/doi.org\/10.1109\/TIT.2011.217324","journal-title":"IEEE Trans Inform Theory"},{"issue":"12","key":"2962_CR21","doi-asserted-by":"publisher","first-page":"5559","DOI":"10.1109\/TIT.2006.885522","volume":"52","author":"M Elad","year":"2006","unstructured":"Elad M (2006) Why simple shrinkage is still relevant for redundant representations? IEEE Trans Inform Theory 52(12):5559\u20135569. https:\/\/doi.org\/10.1109\/TIT.2006.885522","journal-title":"IEEE Trans Inform Theory"},{"key":"2962_CR22","volume-title":"Sparse redundant representations: from theory to applications in signal and image processing","author":"M Elad","year":"2011","unstructured":"Elad M (2011) Sparse redundant representations: from theory to applications in signal and image processing. Springer, New York"},{"issue":"4","key":"2962_CR23","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1137\/13090540X","volume":"6","author":"E Esser","year":"2013","unstructured":"Esser E, Lou Y, Xin J (2013) A method for finding structured sparse solution to nonnegative least squres problems with applications. SIAM J Imaging Sci 6(4):2010\u20132046. https:\/\/doi.org\/10.1137\/13090540X","journal-title":"SIAM J Imaging Sci"},{"key":"2962_CR24","doi-asserted-by":"publisher","unstructured":"Foucart S (2012) Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants. In: Neamtu M, Schumaker L (eds) Approximation theory XIII: San Antonio 2010. Springer Proceedings in Mathematics, vol 13. Springer, New York, NY., pp. 65\u201377. https:\/\/doi.org\/10.1007\/978-1-4614-0772-0_5","DOI":"10.1007\/978-1-4614-0772-0_5"},{"issue":"6","key":"2962_CR25","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart S (2011) Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J Numer Anal 49(6):2543\u20132563. https:\/\/doi.org\/10.1137\/100806278","journal-title":"SIAM J Numer Anal"},{"key":"2962_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A mathematical introduction to compressive sensing","author":"S Foucart","year":"2013","unstructured":"Foucart S, Rauhut H (2013) A mathematical introduction to compressive sensing. Springer, New York"},{"key":"2962_CR27","doi-asserted-by":"publisher","unstructured":"Garg G, Khandekar R (2009) Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property. In: Proc. of the 26th Inter. Conf. Mach. Learn., L. Bottou and M. Littman, eds., ACM, New York, pp. 337\u2013344. https:\/\/doi.org\/10.1145\/1553374.1553417","DOI":"10.1145\/1553374.1553417"},{"key":"2962_CR28","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1007\/s11075-021-01227-1","volume":"90","author":"NN Han","year":"2022","unstructured":"Han NN, Lu J, Li SD (2022) The finite steps of convergence of the fast thresholding algorithms with f-feedbacks in compressed sensing. Numer Algor 90:1197\u20131223. https:\/\/doi.org\/10.1007\/s11075-021-01227-1","journal-title":"Numer Algor"},{"issue":"12","key":"2962_CR29","doi-asserted-by":"publisher","first-page":"4685","DOI":"10.1109\/TSP.2006.882080","volume":"54","author":"P Jost","year":"2006","unstructured":"Jost P, Vandergheynst P, Frossard P (2006) Tree-based pursuit: Algorithm and properties. IEEE Trans Signal Process 54(12):4685\u20134697. https:\/\/doi.org\/10.1109\/TSP.2006.882080","journal-title":"IEEE Trans Signal Process"},{"issue":"5","key":"2962_CR30","doi-asserted-by":"publisher","first-page":"2986","DOI":"10.1109\/TIT.2014.2310482","volume":"60","author":"S Kwon","year":"2014","unstructured":"Kwon S, Wang J, Shim B (2014) Multipath matching pursuit. IEEE Trans Inform Theory 60(5):2986\u20133001. https:\/\/doi.org\/10.1109\/TIT.2014.2310482","journal-title":"IEEE Trans Inform Theory"},{"issue":"3","key":"2962_CR31","doi-asserted-by":"publisher","first-page":"615","DOI":"10.2307\/2372313","volume":"73","author":"L Landweber","year":"1951","unstructured":"Landweber L (1951) An iteration formula for fredholm integral equations of the first kind. Am J Math 73(3):615\u2013624. https:\/\/doi.org\/10.2307\/2372313","journal-title":"Am J Math"},{"key":"2962_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2020.101469","volume":"59","author":"S Li","year":"2020","unstructured":"Li S, Lin JH, Liu DK (2020) Iterative hard thresholding for compressed data separation. J Complex 59:101469. https:\/\/doi.org\/10.1016\/j.jco.2020.101469","journal-title":"J Complex"},{"key":"2962_CR33","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou Y, Yin P, He Q, Xin J (2015) Computing sparse representation in a highly coherent dictionary based on difference of $$l_1$$ and $$l_2$$. J Sci Comput 64:178\u2013196. https:\/\/doi.org\/10.1007\/s10915-014-9930-1","journal-title":"J Sci Comput"},{"key":"2962_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-013-0714-4","volume":"147","author":"ZS Lu","year":"2014","unstructured":"Lu ZS (2014) Iterative hard thresholding methods for $$l_0$$ regularized convex cone programming. Math Progr 147:125\u2013154. https:\/\/doi.org\/10.1007\/s10107-013-0714-4","journal-title":"Math Progr"},{"issue":"2","key":"2962_CR35","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/JSTSP.2009.2039176","volume":"4","author":"A Maleki","year":"2010","unstructured":"Maleki A, Donoho DL (2010) Optimally tuned iterative reconstruction algorithms for compressed sensing. IEEE J Sel Top Signal Process 4(2):330\u2013341. https:\/\/doi.org\/10.1109\/JSTSP.2009.2039176","journal-title":"IEEE J Sel Top Signal Process"},{"key":"2962_CR36","doi-asserted-by":"publisher","first-page":"6594","DOI":"10.1109\/TSP.2020.3037996","volume":"68","author":"N Meng","year":"2020","unstructured":"Meng N, Zhao YB (2020) Newton-step-based hard thresholding algorithms for sparse signal recovery. IEEE Trans Signal Process 68:6594\u20136606. https:\/\/doi.org\/10.1109\/TSP.2020.3037996","journal-title":"IEEE Trans Signal Process"},{"key":"2962_CR37","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s40305-021-00370-9","volume":"10","author":"N Meng","year":"2022","unstructured":"Meng N, Zhao YB (2022) Newton-type optimal thresholding algorithms for sparse optimization problems. J Oper Res Soc China 10:447\u2013469. https:\/\/doi.org\/10.1007\/s40305-021-00370-9","journal-title":"J Oper Res Soc China"},{"key":"2962_CR38","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10898-022-01143-1","volume":"84","author":"N Meng","year":"2022","unstructured":"Meng N, Zhao YB, Ko\u010dvara M, Sun ZF (2022) Partial gradient optimal thresholding algorithms for a class of sparse optimization problems. J Global Optim 84:393\u2013413. https:\/\/doi.org\/10.1007\/s10898-022-01143-1","journal-title":"J Global Optim"},{"issue":"3","key":"2962_CR39","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell D, Tropp JA (2009) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon Anal 26(3):301\u2013321. https:\/\/doi.org\/10.1016\/j.acha.2008.07.002","journal-title":"Appl Comput Harmon Anal"},{"key":"2962_CR40","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10208-008-9031-3","volume":"9","author":"D Needell","year":"2009","unstructured":"Needell D, Vershynin R (2009) Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found Comput Math 9:317\u2013334. https:\/\/doi.org\/10.1007\/s10208-008-9031-3","journal-title":"Found Comput Math"},{"issue":"2","key":"2962_CR41","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","volume":"4","author":"D Needell","year":"2010","unstructured":"Needell D, Vershynin R (2010) Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J Select Top Signal Process 4(2):310\u2013316. https:\/\/doi.org\/10.1109\/JSTSP.2010.2042412","journal-title":"IEEE J Select Top Signal Process"},{"key":"2962_CR42","doi-asserted-by":"publisher","unstructured":"Pati YC, Rezaiifar R, Krishnaprasad PS (1993) Orthogonal matching pursuits: recursive function approximation with applications to wavelet decomposition. In: Proc. the 27th Annual Asilomar Conf. Signals Systems and Computers, Pacific Grove, CA, USA, pp. 40\u201344. https:\/\/doi.org\/10.1109\/ACSSC.1993.342465","DOI":"10.1109\/ACSSC.1993.342465"},{"issue":"208","key":"2962_CR43","first-page":"1","volume":"18","author":"J Shen","year":"2018","unstructured":"Shen J, Li P (2018) A tight bound of hard thresholding. J Mach Learn Res 18(208):1\u201342 (http:\/\/jmlr.org\/papers\/v18\/16-299.html)","journal-title":"J Mach Learn Res"},{"issue":"5","key":"2962_CR44","doi-asserted-by":"publisher","first-page":"S104","DOI":"10.1137\/120876459","volume":"35","author":"J Tanner","year":"2013","unstructured":"Tanner J, Wei K (2013) Normalized iterative hard thresholding for matrix completion. SIAM J Sci Comput 35(5):S104\u2013S125. https:\/\/doi.org\/10.1137\/120876459","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"2962_CR45","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.acha.2008.07.002","volume":"35","author":"S Voronin","year":"2013","unstructured":"Voronin S, Woerdeman HJ (2013) A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints. Appl Comput Harmon Anal 35(1):151\u2013164. https:\/\/doi.org\/10.1016\/j.acha.2008.07.002","journal-title":"Appl Comput Harmon Anal"},{"issue":"12","key":"2962_CR46","doi-asserted-by":"publisher","first-page":"6202","DOI":"10.1109\/TSP.2012.2218810","volume":"60","author":"J Wang","year":"2012","unstructured":"Wang J, Kwon S, Shim B (2012) Generalized orthogonal matching pursuit. IEEE Trans Signal Process 60(12):6202\u20136216. https:\/\/doi.org\/10.1109\/TSP.2012.2218810","journal-title":"IEEE Trans Signal Process"},{"key":"2962_CR47","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s10898-019-00826-6","volume":"76","author":"F Wu","year":"2020","unstructured":"Wu F, Bian W (2020) Accelerated iterative hard thresholding algorithm for $$l_0$$ regularized regression problem. Math Progr 76:819\u2013840. https:\/\/doi.org\/10.1007\/s10898-019-00826-6","journal-title":"Math Progr"},{"key":"2962_CR48","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/LSP.2023.3238878","volume":"30","author":"LJ Xie","year":"2023","unstructured":"Xie LJ (2023) Improved RIC bounds in terms of $$\\delta _{2s}$$ for hard thresholding-based algorithms. IEEE Signal Process Lett 30:21\u201325. https:\/\/doi.org\/10.1109\/LSP.2023.3238878","journal-title":"IEEE Signal Process Lett"},{"issue":"5","key":"2962_CR49","doi-asserted-by":"publisher","first-page":"495","DOI":"10.4208\/jcm.1505-m4529","volume":"33","author":"Z Xu","year":"2015","unstructured":"Xu Z (2015) The performance of orthogonal multi-matching pursuit under the restricted isometry property. J Comput Math 33(5):495\u2013516. https:\/\/doi.org\/10.4208\/jcm.1505-m4529","journal-title":"J Comput Math"},{"issue":"1","key":"2962_CR50","doi-asserted-by":"publisher","first-page":"A229","DOI":"10.1137\/15M103947X","volume":"39","author":"L Yan","year":"2017","unstructured":"Yan L, Shin Y, Xiu D (2017) Sparse approximation using $$l_1-l_2$$ minimization and its applications to stochastic collocation. SIAM J Sci Comput 39(1):A229\u2013A254. https:\/\/doi.org\/10.1137\/15M103947X","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"2962_CR51","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/18M1219187","volume":"30","author":"YB Zhao","year":"2020","unstructured":"Zhao YB (2020) Optimal $$k$$-thresholding algorithms for sparse optimization problems. SIAM J Optim 30(1):31\u201355. https:\/\/doi.org\/10.1137\/18M1219187","journal-title":"SIAM J Optim"},{"key":"2962_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108148","volume":"187","author":"YB Zhao","year":"2021","unstructured":"Zhao YB, Luo ZQ (2021) Analysis of optimal thresholding algorithms for compressed sensing. Signal Process 187:108,148. https:\/\/doi.org\/10.1016\/j.sigpro.2021.108148","journal-title":"Signal Process"},{"key":"2962_CR53","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s11425-021-1987-2","volume":"66","author":"YB Zhao","year":"2023","unstructured":"Zhao YB, Luo ZQ (2023) Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms. Sci China Math 66:1123\u20131140. https:\/\/doi.org\/10.1007\/s11425-021-1987-2","journal-title":"Sci China Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02962-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02962-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02962-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T05:15:28Z","timestamp":1741065328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02962-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2962"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02962-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"21 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1"}}