{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T06:20:14Z","timestamp":1773469214322,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T00:00:00Z","timestamp":1755129600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T00:00:00Z","timestamp":1755129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Natural Science Foundation of Ningxia Province","award":["2023AAC03005"],"award-info":[{"award-number":["2023AAC03005"]}]},{"name":"the Ningxia Autonomous Region Key Research and Development Program","award":["2022BSB03047"],"award-info":[{"award-number":["2022BSB03047"]}]},{"name":"the Ningxia youth talent support program"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261068"],"award-info":[{"award-number":["12261068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s00034-025-03280-w","type":"journal-article","created":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T19:16:33Z","timestamp":1755198993000},"page":"1270-1285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sufficient Conditions Based on RIC for the PHT Algorithm"],"prefix":"10.1007","volume":"45","author":[{"given":"Wenhui","family":"Tian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7447-4917","authenticated-orcid":false,"given":"Pengbo","family":"Geng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,14]]},"reference":[{"issue":"2","key":"3280_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.acha.2008.08.002","volume":"26","author":"L Applebaum","year":"2009","unstructured":"L. Applebaum, S.D. Howard, S. Searle et al., Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery. Appl. Comput. Harmon. Anal. 26(2), 283\u2013290 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"3280_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"A. Beck, M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"6","key":"3280_CR3","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.1109\/TIT.2013.2245716","volume":"59","author":"T Blumensath","year":"2013","unstructured":"T. Blumensath, Compressed sensing with nonlinear observations and related nonlinear optimization problems. IEEE Trans. Inf. Theory 59(6), 3466\u20133474 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"3280_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"T. Blumensath, M.E. Davies, Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"3280_CR5","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.acha.2016.03.002","volume":"41","author":"JL Bouchot","year":"2016","unstructured":"J.L. Bouchot, S. Foucart, P. Hitczenko, Hard thresholding pursuit algorithms: number of iterations. Appl. Comput. Harmon. Anal. 41(2), 412\u2013435 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"5\u20136","key":"3280_CR6","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s00041-008-9041-1","volume":"14","author":"K Bredies","year":"2008","unstructured":"K. Bredies, D.A. Lorenz, Linear convergence of iterative soft-thresholding. J. Fourier Anal. Appl. 14(5\u20136), 813\u2013837 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"3280_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.acha.2021.10.002","volume":"56","author":"JF Cai","year":"2022","unstructured":"J.F. Cai, J.Z. Li, X.L. Lu et al., Sparse signal recovery from phaseless measurements via hard thresholding pursuit. Appl. Comput. Harmon. Anal. 56, 367\u2013390 (2022)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"9","key":"3280_CR8","doi-asserted-by":"publisher","first-page":"4388","DOI":"10.1109\/TIT.2010.2054730","volume":"56","author":"TT Cai","year":"2010","unstructured":"T.T. Cai, L. Wang, G. Xu, New bounds for restricted isometry constants. IEEE Trans. Inf. Theory 56(9), 4388\u20134394 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"3280_CR9","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"E.J. Cand\u00e8s, T. Tao, Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"3280_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1137\/18M1188446","volume":"12","author":"HB Chang","year":"2019","unstructured":"H.B. Chang, P. Enfedaque, S. Marchesini, Blind ptychographic phase retrieval via convergent alternating direction method of multipliers. SIAM J. Imag. Sci. 12(1), 153\u2013185 (2019)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"3280_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"S.S. Chen, D.L. Donoho, M.A. Saunders, Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"3280_CR12","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"3280_CR13","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"I. Daubechies, M. Defrise, C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"issue":"11","key":"3280_CR14","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"DL Donoho","year":"2008","unstructured":"D.L. Donoho, Y. Tsaig, Fast solution of $$\\ell _1$$-norm minimization problems when the solution may be sparse. IEEE Trans. Inf. Theory 54(11), 4789\u20134812 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"3280_CR15","doi-asserted-by":"publisher","first-page":"5559","DOI":"10.1109\/TIT.2006.885522","volume":"52","author":"M Elad","year":"2006","unstructured":"M. Elad, Why simple shrinkage is still relevant for redundant representations? IEEE Trans. Inf. Theory 52(12), 5559\u20135569 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"3280_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"M.A.T. Figueiredo, R.D. Nowak, S.J. Wright, Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 1(4), 586\u2013597 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"6","key":"3280_CR17","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"S. Foucart, Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6), 2543\u20132563 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"3280_CR18","doi-asserted-by":"publisher","first-page":"109260","DOI":"10.1016\/j.sigpro.2023.109260","volume":"215","author":"ZH He","year":"2024","unstructured":"Z.H. He, Q.Y. Shu, Y.H. Wang et al., A ReLU-based hard-thresholding algorithm for non-negative sparse signal recovery. Signal Process. 215, 109260 (2024)","journal-title":"Signal Process."},{"issue":"4","key":"3280_CR19","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1109\/TII.2012.2189222","volume":"9","author":"SC Li","year":"2013","unstructured":"S.C. Li, L.D. Xu, X.H. Wang, Compressed sensing signal and data acquisition in wireless sensor networks and internet of things. IEEE Trans. Ind. Inf. 9(4), 2177\u20132186 (2013)","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"1","key":"3280_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00041-022-09984-w","volume":"29","author":"S Li","year":"2023","unstructured":"S. Li, D.K. Liu, Y. Shen, Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints. J. Fourier Anal. Appl. 29(1), 5 (2023)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"3280_CR21","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s40305-021-00370-9","volume":"10","author":"N Meng","year":"2022","unstructured":"N. Meng, Y.B. Zhao, Newton-type optimal thresholding algorithms for sparse optimization problems. J. Oper. Res. Soc. China 10(3), 447\u2013469 (2022)","journal-title":"J. Oper. Res. Soc. China"},{"key":"3280_CR22","doi-asserted-by":"publisher","first-page":"6594","DOI":"10.1109\/TSP.2020.3037996","volume":"68","author":"N Meng","year":"2020","unstructured":"N. Meng, Y.B. Zhao, Newton-step-based hard thresholding algorithms for sparse signal recovery. IEEE Trans. Signal Process. 68, 6594\u20136606 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"3280_CR23","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"D. Needell, J.A. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"3280_CR24","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10208-008-9031-3","volume":"9","author":"D Needell","year":"2009","unstructured":"D. Needell, R. Vershynin, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found. Comput. Math. 9(3), 317\u2013334 (2009)","journal-title":"Found. Comput. Math."},{"key":"3280_CR25","doi-asserted-by":"crossref","unstructured":"V.M. Patel, R. Chellappa, Sparse representations, compressive sensing and dictionaries for pattern recognition. Paper presented at the First Asian Conference on Pattern Recognition, Beijing, China, 28\u201328 November 2011 (2011)","DOI":"10.1109\/ACPR.2011.6166711"},{"issue":"3","key":"3280_CR26","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MSP.2018.2789521","volume":"35","author":"ZJ Qin","year":"2018","unstructured":"Z.J. Qin, J.C. Fan, Y.W. Liu et al., Sparse representation for wireless communications: A compressive sensing approach. IEEE Signal Process. Mag. 35(3), 40\u201358 (2018)","journal-title":"IEEE Signal Process. Mag."},{"issue":"208","key":"3280_CR27","first-page":"1","volume":"18","author":"J Shen","year":"2018","unstructured":"J. Shen, P. Li, A tight bound of hard thresholding. J. Mach. Learn. Res. 18(208), 1\u201342 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"3280_CR28","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1109\/TIP.2019.2928136","volume":"29","author":"WZ Shi","year":"2020","unstructured":"W.Z. Shi, F. Jiang, S.H. Liu et al., Image compressed sensing using convolutional neural network. IEEE Trans. Image Process. 29, 375\u2013388 (2020)","journal-title":"IEEE Trans. Image Process."},{"key":"3280_CR29","doi-asserted-by":"publisher","first-page":"115264","DOI":"10.1016\/j.cam.2023.115264","volume":"430","author":"ZF Sun","year":"2023","unstructured":"Z.F. Sun, J.C. Zhou, Y.B. Zhao et al., Heavy-ball-based hard thresholding algorithms for sparse signal recovery. J. Comput. Appl. Math. 430, 115264 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"12","key":"3280_CR30","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"J.A. Tropp, A.C. Gilbert, Signal recovery from partial information via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3280_CR31","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/LSP.2023.3282440","volume":"30","author":"YH Wang","year":"2023","unstructured":"Y.H. Wang, Z.H. He, G.M. Zhang et al., Improved sufficient conditions based on RIC of order $$2s$$ for IHT and HTP algorithms. IEEE Signal Process. Lett. 30, 668\u2013672 (2023)","journal-title":"IEEE Signal Process. Lett."},{"issue":"5","key":"3280_CR32","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/LSP.2014.2364851","volume":"22","author":"K Wei","year":"2015","unstructured":"K. Wei, Fast iterative hard thresholding for compressed sensing. IEEE Signal Process. Lett. 22(5), 593\u2013597 (2015)","journal-title":"IEEE Signal Process. Lett."},{"issue":"7","key":"3280_CR33","doi-asserted-by":"publisher","first-page":"7621","DOI":"10.1109\/TITS.2022.3172868","volume":"24","author":"JM Wen","year":"2023","unstructured":"J.M. Wen, H.Y. He, Z.H. He et al., A pseudo-inverse-based hard thresholding algorithm for sparse signal recovery. IEEE Trans. Intell. Transport. Syst. 24(7), 7621\u20137630 (2023)","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"issue":"6","key":"3280_CR34","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1109\/TSP.2016.2634550","volume":"65","author":"JM Wen","year":"2017","unstructured":"J.M. Wen, Z.C. Zhou, J. Wang et al., A sharp condition for exact support recovery with orthogonal matching pursuit. IEEE Trans. Signal Process. 65(6), 1370\u20131382 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"3280_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/LSP.2023.3238878","volume":"30","author":"LJ Xie","year":"2023","unstructured":"L.J. Xie, Improved RIC bounds in terms of $$\\delta _{2s}$$ for hard thresholding-based algorithms. IEEE Signal Process. Lett. 30, 21\u201325 (2023)","journal-title":"IEEE Signal Process. Lett."},{"key":"3280_CR36","doi-asserted-by":"publisher","DOI":"10.1080\/00036811.2024.2311697","author":"LJ Xie","year":"2024","unstructured":"L.J. Xie, J.P. Wang, Sufficient condition based on nearly optimal order RIC for IHT algorithm. Appl. Anal. (2024). https:\/\/doi.org\/10.1080\/00036811.2024.2311697","journal-title":"Appl. Anal."},{"issue":"1","key":"3280_CR37","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/18M1219187","volume":"30","author":"YB Zhao","year":"2020","unstructured":"Y.B. Zhao, Optimal $$k$$-thresholding algorithms for sparse optimization problems. SIAM J. Optim. 30(1), 31\u201355 (2020)","journal-title":"SIAM J. Optim."},{"key":"3280_CR38","doi-asserted-by":"publisher","first-page":"108148","DOI":"10.1016\/j.sigpro.2021.108148","volume":"187","author":"YB Zhao","year":"2021","unstructured":"Y.B. Zhao, Z.Q. Luo, Analysis of optimal thresholding algorithms for compressed sensing. Signal Process. 187, 108148 (2021)","journal-title":"Signal Process."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-025-03280-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00034-025-03280-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-025-03280-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T05:40:11Z","timestamp":1773466811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00034-025-03280-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,14]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["3280"],"URL":"https:\/\/doi.org\/10.1007\/s00034-025-03280-w","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,14]]},"assertion":[{"value":"19 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2025","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"}}]}}