{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T15:59:02Z","timestamp":1782575942666,"version":"3.54.5"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","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,4]]},"DOI":"10.1007\/s00034-025-03310-7","type":"journal-article","created":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:30:11Z","timestamp":1759062611000},"page":"2721-2752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nesterov\u2019s Accelerated Hard Thresholding Pursuit Algorithms for Compressed Sensing"],"prefix":"10.1007","volume":"45","author":[{"given":"Liping","family":"Geng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongchao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingyong","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2469-2123","authenticated-orcid":false,"given":"Jinchuan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,28]]},"reference":[{"issue":"3","key":"3310_CR1","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/22M1474357","volume":"32","author":"H Attouch","year":"2022","unstructured":"H. Attouch, J. Fadili, From the ravine method to the Nesterov method and vice versa: a dynamical system perspective. SIAM J. Optim. 32(3), 2074\u20132101 (2022)","journal-title":"SIAM J. Optim."},{"key":"3310_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-022-01770-2","volume":"198","author":"JF Aujol","year":"2023","unstructured":"J.F. Aujol, C. Dossal, A. Rondepierre, Convergence rates of the Heavy-Ball method under the Lojasiewicz property. Math. Program. 198, 195\u2013254 (2023)","journal-title":"Math. Program."},{"issue":"4","key":"3310_CR3","first-page":"289","volume":"4","author":"JD Blanchard","year":"2015","unstructured":"J.D. Blanchard, J. Tanner, K. Wei, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion. Inf. Inference. 4(4), 289\u2013327 (2015)","journal-title":"Inf. Inference."},{"issue":"3","key":"3310_CR4","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.sigpro.2011.09.017","volume":"92","author":"T Blumensath","year":"2012","unstructured":"T. Blumensath, Accelerated iterative hard thresholding. Signal Process. 92(3), 752\u2013756 (2012)","journal-title":"Signal Process."},{"issue":"2","key":"3310_CR5","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"T. Blumensath, M.E. Davies, Normalized iterative hard thresholding: guaranteed stability and performance. IEEE J. Sel. Top. Signal Process. 4(2), 298\u2013309 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"2","key":"3310_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"L. Bottou, F.E. Curtis, J. Nocedal, Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"2","key":"3310_CR7","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.acha.2016.03.002","volume":"41","author":"J Bouchot","year":"2016","unstructured":"J. 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."},{"key":"3310_CR8","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, J.T. You, 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":"12","key":"3310_CR9","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"E.J. Candes, T. Tao, Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3310_CR10","unstructured":"V. Cevher, S. Jafarpour, Fast hard thresholding with Nesterov\u2019s gradient method. In Neuronal Information Processing Systems, Workshop on Practical Applications of Sparse Modeling, Whistler, Canada (2010)"},{"key":"3310_CR11","doi-asserted-by":"publisher","first-page":"5412","DOI":"10.1109\/TIP.2022.3195319","volume":"31","author":"B Chen","year":"2022","unstructured":"B. Chen, J. Zhang, Content-aware scalable deep compressed sensing. IEEE Trans. Image Process. 31, 5412\u20135426 (2022)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"3310_CR12","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1007\/s10208-022-09573-9","volume":"23","author":"C Criscitiello","year":"2023","unstructured":"C. Criscitiello, N. Boumal, An accelerated first-order method for non-convex optimization on manifolds. Found. Comput. Math. 23(4), 1433\u20131509 (2023)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"3310_CR13","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":"1","key":"3310_CR14","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1137\/20M1322716","volume":"31","author":"J Diakonikolas","year":"2021","unstructured":"J. Diakonikolas, M.I. Jordan, Generalized momentum-based methods: a Hamiltonian perspective. SIAM J. Optim. 31(1), 915\u2013944 (2021)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"3310_CR15","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":"3310_CR16","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":"S. Foucart, H. Rauhut, A Mathematical Introduction to Compressive Sensing (Springer, Berlin, 2013)"},{"key":"3310_CR17","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/s00034-021-01805-7","volume":"41","author":"X Gao","year":"2022","unstructured":"X. Gao, J. Zhou, L1 RIP-based robust compressed sensing. Circuits Syst. Signal Process. 41, 851\u2013866 (2022)","journal-title":"Circuits Syst. Signal Process."},{"key":"3310_CR18","doi-asserted-by":"crossref","unstructured":"L.P. Geng, J.C. Zhou, Z.F. Sun, J.Y. Tang, Recovery of sparse signals via modified hard thresholding pursuit algorithms. IET Signal Process. 9937696 (2023)","DOI":"10.1049\/2023\/9937696"},{"key":"3310_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2023.109260","volume":"215","author":"ZH He","year":"2024","unstructured":"Z.H. He, Q.Y. Shu, Y.H. Wang, J.M. Wen, A ReLU-based hard-thresholding algorithm for non-negative sparse signal recovery. Signal Process. 215, 109260 (2024)","journal-title":"Signal Process."},{"key":"3310_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10107-024-02068-1","volume":"211","author":"YH Hu","year":"2025","unstructured":"Y.H. Hu, X.L. Hu, X.Q. Yang, On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization. Math. Program. 211, 181\u2013206 (2025)","journal-title":"Math. Program."},{"key":"3310_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10915-024-02682-3","volume":"101","author":"XL Hu","year":"2024","unstructured":"X.L. Hu, Y.H. Hu, X.Q. Yang, K. Zhang, Constrained mix sparse optimization via hard thresholding pursuit. J. Sci. Comput. 101, 55 (2024)","journal-title":"J. Sci. Comput."},{"issue":"36","key":"3310_CR22","first-page":"1","volume":"23","author":"FH Huang","year":"2022","unstructured":"F.H. Huang, S.Q. Gao, J. Pei, H. Huang, Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization. J. Mach. Learn. Res. 23(36), 1\u201370 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"3310_CR23","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1109\/LSP.2025.3550768","volume":"32","author":"W Jin","year":"2025","unstructured":"W. Jin, L.J. Xie, Momentum-based iterative hard thresholding algorithm for sparse signal recovery. IEEE Signal Process. Lett. 32, 1346\u20131350 (2025)","journal-title":"IEEE Signal Process. Lett."},{"key":"3310_CR24","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1109\/TSP.2020.2967175","volume":"68","author":"ML Ke","year":"2020","unstructured":"M.L. Ke, Z. Gao, Y.P. Wu, X.Q. Gao, R. Schober, Compressive sensing-based adaptive active user detection and channel estimation: massive access meets massive mimo. IEEE Trans. Signal Process. 68, 764\u2013779 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"3310_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-024-02091-2","volume":"212","author":"AS Lewis","year":"2025","unstructured":"A.S. Lewis, T.H. Tian, The complexity of first-order optimization methods from a metric perspective. Math. Program. 212, 49\u201378 (2025)","journal-title":"Math. Program."},{"key":"3310_CR26","doi-asserted-by":"publisher","first-page":"6210","DOI":"10.1007\/s00034-023-02396-1","volume":"42","author":"Z Li","year":"2023","unstructured":"Z. Li, X. Zheng, G. Chen, Y. Wei, K. Lu, A matching pursuit algorithm for sparse signal reconstruction based on Jaccard coefficient and backtracking. Circuits Syst. Signal Process. 42, 6210\u20136227 (2023)","journal-title":"Circuits Syst. Signal Process."},{"key":"3310_CR27","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."},{"key":"3310_CR28","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10898-022-01143-1","volume":"84","author":"N Meng","year":"2022","unstructured":"N. Meng, Y.B. Zhao, M. Kocvara, Z.F. Sun, Partial gradient optimal thresholding algorithms for a class of sparse optimization problems. J. Global Optim. 84, 393\u2013413 (2022)","journal-title":"J. Global Optim."},{"issue":"4","key":"3310_CR29","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2297","volume":"27","author":"D Mitchell","year":"2020","unstructured":"D. Mitchell, N. Ye, H.D. Sterck, Nesterov acceleration of alternating least squares for canonical tensor decomposition: momentum step size selection and restart mechanisms. Numer. Linear Algebra Appl. 27(4), e2297 (2020)","journal-title":"Numer. Linear Algebra Appl."},{"key":"3310_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"I. Necoara, Y. Nesterov, F. Glineur, Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019)","journal-title":"Math. Program."},{"issue":"3","key":"3310_CR31","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."},{"key":"3310_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Y. Nesterov, Lectures on Convex Optimization (Springer, Berlin, 2018)"},{"issue":"3","key":"3310_CR33","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Y. Nesterov, A method of solving a convex programming problem with convergence rate $$\\begin{subarray}{c}{\\mathcal{O}}(1\/k^{2})\\end{subarray}$$. Sov. Math. Dokl. 269(3), 543 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"3310_CR34","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10107-021-01681-8","volume":"195","author":"B Shi","year":"2022","unstructured":"B. Shi, S.S. Du, M.I. Jordan, W.J. Su, Understanding the acceleration phenomenon via high-resolution differential equations. Math. Program. 195, 79\u2013148 (2022)","journal-title":"Math. Program."},{"key":"3310_CR35","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1007\/s00034-024-02902-z","volume":"44","author":"RP Singh","year":"2025","unstructured":"R.P. Singh, M.K. Singh, An efficient hybrid threshold for image deconvolution in expectation maximization framework. Circuits Syst. Signal Process. 44, 1938\u20131982 (2025)","journal-title":"Circuits Syst. Signal Process."},{"issue":"153","key":"3310_CR36","first-page":"1","volume":"17","author":"WJ Su","year":"2016","unstructured":"W.J. Su, S. Boyd, E.J. Candes, A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. J. Mach. Learn. Res. 17(153), 1\u201343 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"3310_CR37","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10915-023-02315-1","volume":"96","author":"ZF Sun","year":"2023","unstructured":"Z.F. Sun, J.C. Zhou, Y.B. Zhao, Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems. J. Sci. Comput. 96(3), 93 (2023)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"3310_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2023.115264","volume":"430","author":"ZF Sun","year":"2023","unstructured":"Z.F. Sun, J.C. Zhou, Y.B. Zhao, N. Meng, Heavy-ball-based hard thresholding algorithms for sparse signal recovery. J. Comput. Appl. Math. 430(1), 115264 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"3310_CR39","unstructured":"T.H. Tran, K. Scheinberg, L.M. Nguyen, Nesterov accelerated shuffling gradient method for convex optimization. In Proceedings of the 39th International Conference on Machine Learning, PMLR. vol. 162, pp. 21703\u201321732 (2022)"},{"issue":"12","key":"3310_CR40","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 random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3310_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.sigpro.2018.10.010","volume":"156","author":"A Zaki","year":"2019","unstructured":"A. Zaki, P.P. Mitra, L.K. Rasmussen, S. Chatterjee, Estimate exchange over network is good for distributed hard thresholding pursuit. Signal Process. 156, 1\u201311 (2019)","journal-title":"Signal Process."},{"key":"3310_CR42","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00034-019-01174-2","volume":"39","author":"Y Zhang","year":"2020","unstructured":"Y. Zhang, X. Li, G. Zhao, B. Lu, C. Cavalcante, Signal reconstruction of compressed sensing based on alternating direction method of multipliers. Circuits Syst. Signal Process. 39, 307\u2013323 (2020)","journal-title":"Circuits Syst. Signal Process."},{"issue":"1","key":"3310_CR43","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":"3310_CR44","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/OJSP.2022.3195115","volume":"3","author":"YB Zhao","year":"2022","unstructured":"Y.B. Zhao, Z.Q. Luo, Natural thresholding algorithms for signal recovery with sparsity. IEEE Open J. Signal Process. 3, 417\u2013431 (2022)","journal-title":"IEEE Open J. Signal Process."},{"key":"3310_CR45","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1109\/TSP.2022.3156911","volume":"70","author":"SL Zhou","year":"2022","unstructured":"S.L. Zhou, Z.Y. Luo, N.H. Xiu, G.Y. Li, Computing one-bit compressive sensing via double-sparsity constrained optimization. IEEE Trans. Signal Process. 70, 1593\u20131608 (2022)","journal-title":"IEEE Trans. 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-03310-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00034-025-03310-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-025-03310-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T09:02:07Z","timestamp":1777107727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00034-025-03310-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,28]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3310"],"URL":"https:\/\/doi.org\/10.1007\/s00034-025-03310-7","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,28]]},"assertion":[{"value":"5 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 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 have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}