{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T20:50:30Z","timestamp":1778532630208,"version":"3.51.4"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"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","award":["12071307"],"award-info":[{"award-number":["12071307"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10915-023-02315-1","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T10:01:50Z","timestamp":1691748110000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Heavy-Ball-Based Optimal Thresholding Algorithms for Sparse Linear Inverse Problems"],"prefix":"10.1007","volume":"96","author":[{"given":"Zhong-Feng","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Chuan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2388-9047","authenticated-orcid":false,"given":"Yun-Bin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"2315_CR1","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.apnum.2022.10.009","volume":"184","author":"M Alotaibi","year":"2023","unstructured":"Alotaibi, M., Buccini, A., Reichel, L.: Krylov subspace split Bregman methods. Appl. Numer. Math. 184, 371\u2013390 (2023)","journal-title":"Appl. Numer. Math."},{"key":"2315_CR2","first-page":"197","volume-title":"The MOSEK Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm. High Performance Optimization","author":"E.D Andersen","year":"2000","unstructured":"Andersen, E..D., Andersen, K..D.: The MOSEK Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm. High Performance Optimization, pp. 197\u2013232. Springer, Boston, MA (2000)"},{"key":"2315_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10107-022-01770-2","volume":"198","author":"JF Aujol","year":"2023","unstructured":"Aujol, J.F., Dossal, C., Rondepierre, A.: Convergence rates of the heavy-ball method under the \u0141ojasiewicz property. Math. Prog. 198, 195\u2013254 (2023)","journal-title":"Math. Prog."},{"issue":"1","key":"2315_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: 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":"2","key":"2315_CR5","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/nla.1948","volume":"22","author":"JD Blanchard","year":"2015","unstructured":"Blanchard, J.D., Tanner, J.: Performance comparisons of greedy algorithms in compressed sensing. Numer. Linear Algebra Appl. 22(2), 254\u2013282 (2015)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"4","key":"2315_CR6","first-page":"289","volume":"4","author":"JD Blanchard","year":"2015","unstructured":"Blanchard, J.D., Tanner, J., Wei, K.: CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion. IMA J. Inf. Inference 4(4), 289\u2013327 (2015)","journal-title":"IMA J. Inf. Inference"},{"issue":"3","key":"2315_CR7","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.sigpro.2011.09.017","volume":"92","author":"T Blumensath","year":"2012","unstructured":"Blumensath, T.: Accelerated iterative hard thresholding. Signal Process. 92(3), 752\u2013756 (2012)","journal-title":"Signal Process."},{"key":"2315_CR8","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14, 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"2315_CR9","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath, T., Davies, M.E.: 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":"16","key":"2315_CR10","doi-asserted-by":"crossref","first-page":"4293","DOI":"10.1109\/TSP.2017.2708040","volume":"65","author":"M Borgerding","year":"2017","unstructured":"Borgerding, M., Schniter, P., Rangan, S.: AMP-Inspired deep networks for sparse linear inverse problems. IEEE Trans. Signal Process. 65(16), 4293\u20134308 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"2315_CR11","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1007\/s11075-020-01004-6","volume":"87","author":"A Buccini","year":"2021","unstructured":"Buccini, A., Pasha, M., Reichel, L.: Linearized Krylov subspace Bregman iteration with nonnegativity constraint. Numer. Algo. 87, 1177\u20131200 (2021)","journal-title":"Numer. Algo."},{"issue":"3","key":"2315_CR12","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1287\/ijoc.2017.0789","volume":"30","author":"C Buchheim","year":"2018","unstructured":"Buchheim, C., Traversi, E.: Quadratic combinatorial optimization using separable underestimators. INFORMS J. Comput. 30(3), 424\u2013437 (2018)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2315_CR13","doi-asserted-by":"crossref","first-page":"B164","DOI":"10.1137\/140976261","volume":"38","author":"Y Cai","year":"2016","unstructured":"Cai, Y., Donatelli, M., Bianchi, D., Huang, T.Z.: Regularization preconditioners for frame-based image deblurring with reduced boundary artifacts. SIAM J. Sci. Comput. 38(1), B164\u2013B189 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"12","key":"2315_CR14","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inform. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2315_CR15","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$-minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"2315_CR16","doi-asserted-by":"crossref","unstructured":"Chaovalitwongse, W.A., Androulakis, I.P., Pardalos, P.M.: Quadratic integer programming: Complexity and equivalent forms. In: Floudas C.A., Pardalos P.M.: (eds) Encyclopedia of Optimization. Springer, Boston, MA (2008)","DOI":"10.1007\/978-0-387-74759-0_536"},{"issue":"10","key":"2315_CR17","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"2315_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2315_CR19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/JSAC.2020.3036959","volume":"39","author":"W Chen","year":"2021","unstructured":"Chen, W., Zhang, B., Jin, S., Ai, B., Zhong, Z.: Solving sparse linear inverse problems in communication systems: A deep learning approach with adaptive depth. IEEE J. Sel. Areas Commun. 39(1), 4\u201317 (2021)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"5","key":"2315_CR20","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inform. Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"2315_CR21","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De, Mol C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Comm. Pure Appl. Math."},{"issue":"3","key":"2315_CR22","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho, D.L.: De-noising by soft-thresholding. IEEE Trans. Inform. Theory 41(3), 613\u2013627 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2315_CR23","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/biomet\/81.3.425","volume":"81","author":"DL Donoho","year":"1994","unstructured":"Donoho, D.L., Johnstone, I.M.: Ideal spatial adaptation by wavelet shrinkage. Biometrika 81(3), 425\u2013455 (1994)","journal-title":"Biometrika"},{"issue":"12","key":"2315_CR24","doi-asserted-by":"crossref","first-page":"5559","DOI":"10.1109\/TIT.2006.885522","volume":"52","author":"M Elad","year":"2006","unstructured":"Elad, M.: Why simple shrinkage is still relevant for redundant representations? IEEE Trans. Inform. Theory 52(12), 5559\u20135569 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2315_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing","author":"M Elad","year":"2010","unstructured":"Elad, M.: Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. Springer, New York (2010)"},{"key":"2315_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511794308","volume-title":"Compressed Sensing: Theory and Applications","author":"YC Eldar","year":"2012","unstructured":"Eldar, Y.C., Kutyniok, G.: Compressed Sensing: Theory and Applications. Cambridge University Press, Cambridge (2012)"},{"issue":"6","key":"2315_CR27","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart, S.: Hard thresholding pursuit: An algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6), 2543\u20132563 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"2315_CR28","doi-asserted-by":"crossref","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.: A Mathematical Introduction to Compressive Sensing. Springer, New York (2013)"},{"key":"2315_CR29","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"2315_CR30","unstructured":"Grant, M., Boyd, S.: CVX: matlab software for disciplined convex programming. Version 1.21 (2017)"},{"issue":"2","key":"2315_CR31","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/15M1049695","volume":"27","author":"M G\u00fcrb\u00fczbalaban","year":"2017","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., Parrilo, P.A.: On the convergence rate of incremental aggregated gradient algorithms. SIAM J. Opt. 27(2), 1035\u20131048 (2017)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"2315_CR32","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1137\/20M1355847","volume":"32","author":"N Kuru","year":"2022","unstructured":"Kuru, N., Birbil, \u015e.\u0130., G\u00fcrb\u00fczbalaban, M., Yildirim, S.: Differentially private accelerated optimization algorithms. SIAM J. Opt. 32(2), 795\u2013821 (2022)","journal-title":"SIAM J. Opt."},{"key":"2315_CR33","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10851-013-0434-7","volume":"48","author":"A Kyrillidis","year":"2014","unstructured":"Kyrillidis, A., Cevher, V.: Matrix recipes for hard thresholding methods. J. Math. Imag. Vis. 48, 235\u2013265 (2014)","journal-title":"J. Math. Imag. Vis."},{"issue":"1","key":"2315_CR34","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard, L., Recht, B., Packard, A.: Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J. Opt. 26(1), 57\u201395 (2016)","journal-title":"SIAM J. Opt."},{"issue":"7","key":"2315_CR35","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1109\/LGRS.2019.2943937","volume":"17","author":"S Li","year":"2020","unstructured":"Li, S., Amin, M., Zhao, G., Sun, H.: Radar imaging by sparse optimization incorporating MRF clustering prior. IEEE Geosci. Remote Sens. Lett. 17(7), 1139\u20131143 (2020)","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"issue":"12","key":"2315_CR36","doi-asserted-by":"crossref","first-page":"5723","DOI":"10.1109\/TNNLS.2020.3027381","volume":"32","author":"H Li","year":"2021","unstructured":"Li, H., Cheng, H., Wang, Z., Wu, G.C.: Distributed Nesterov gradient and heavy-ball double accelerated asynchronous optimization. IEEE Trans. Neural Netw. Learn. Syst. 32(12), 5723\u20135737 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"9","key":"2315_CR37","doi-asserted-by":"crossref","first-page":"2130","DOI":"10.1109\/TMI.2016.2550080","volume":"35","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Zhan, Z., Cai, J.F., Guo, D., Chen, Z., Qu, X.: Projected iterative soft-thresholding algorithm for tight frames in compressed sensing magnetic resonance imaging. IEEE Trans. Med. Imag. 35(9), 2130\u20132140 (2016)","journal-title":"IEEE Trans. Med. Imag."},{"key":"2315_CR38","doi-asserted-by":"crossref","first-page":"6594","DOI":"10.1109\/TSP.2020.3037996","volume":"68","author":"N Meng","year":"2020","unstructured":"Meng, N., Zhao, Y.B.: 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":"2315_CR39","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s40305-021-00370-9","volume":"10","author":"N Meng","year":"2022","unstructured":"Meng, N., Zhao, Y.B.: Newton-type optimal thresholding algorithms for sparse optimization problems. J. Oper. Res. Soc. China 10, 447\u2013469 (2022)","journal-title":"J. Oper. Res. Soc. China"},{"key":"2315_CR40","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10898-022-01143-1","volume":"84","author":"N Meng","year":"2022","unstructured":"Meng, N., Zhao, Y.B., Ko\u010dvara, M., Sun, Z.F.: Partial gradient optimal thresholding algorithms for a class of sparse optimization problems. J. Global Opt. 84, 393\u2013413 (2022)","journal-title":"J. Global Opt."},{"issue":"6","key":"2315_CR41","doi-asserted-by":"crossref","first-page":"2480","DOI":"10.1109\/TAC.2020.3008297","volume":"66","author":"H Mohammadi","year":"2021","unstructured":"Mohammadi, H., Razaviyayn, M., Jovanovi\u0107, M.R.: Robustness of accelerated first-order algorithms for strongly convex optimization problems. IEEE Trans. Auto. Control 66(6), 2480\u20132495 (2021)","journal-title":"IEEE Trans. Auto. Control"},{"issue":"3","key":"2315_CR42","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: 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":"6","key":"2315_CR43","doi-asserted-by":"crossref","first-page":"4129","DOI":"10.1109\/TIT.2017.2773497","volume":"64","author":"S Oymak","year":"2018","unstructured":"Oymak, S., Recht, B., Soltanolkotabi, M.: Sharp time-data tradeoffs for linear inverse problems. IEEE Trans. Inform. Theory 64(6), 4129\u20134158 (2018)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2315_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2315_CR45","doi-asserted-by":"crossref","unstructured":"Schniter P., Potter L.C., Ziniel J.: Fast Bayesian matching pursuit. In: Proc. Inform. Theory Appl. Workshop 326\u2013333 (2008)","DOI":"10.1109\/ITA.2008.4601068"},{"key":"2315_CR46","volume":"430","author":"ZF Sun","year":"2023","unstructured":"Sun, Z.F., Zhou, J.C., Zhao, Y.B., Meng, N.: Heavy-ball-based hard thresholding algorithms for sparse signal recovery. J. Comput. Appl. Math. 430, 115264 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"2315_CR47","doi-asserted-by":"crossref","first-page":"6164","DOI":"10.1109\/TIP.2020.2988779","volume":"29","author":"T Tirer","year":"2020","unstructured":"Tirer, T., Giryes, R.: Back-projection based fidelity term for ill-posed linear inverse problems. IEEE Trans. Image Process. 29, 6164\u20136179 (2020)","journal-title":"IEEE Trans. Image Process."},{"issue":"12","key":"2315_CR48","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2315_CR49","doi-asserted-by":"crossref","unstructured":"Tropp J.A., Wright S.J.: Computational methods for sparse solution of linear inverse problems. In: Proc. IEEE 98(6), 948\u2013958 (2010)","DOI":"10.1109\/JPROC.2010.2044010"},{"key":"2315_CR50","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1109\/LCSYS.2022.3163408","volume":"6","author":"V Ugrinovskii","year":"2022","unstructured":"Ugrinovskii, V., Petersen, I.R., Shames, I.: Global convergence and asymptotic optimality of the heavy ball method for a class of nonconvex optimization problems. IEEE Control Syst. Lett. 6, 2449\u20132454 (2022)","journal-title":"IEEE Control Syst. Lett."},{"issue":"8","key":"2315_CR51","doi-asserted-by":"crossref","first-page":"2153","DOI":"10.1109\/TSP.2004.831016","volume":"52","author":"DP Wipf","year":"2004","unstructured":"Wipf, D.P., Rao, B.D.: Sparse Bayesian learning for basis selection. IEEE Trans. Signal Process. 52(8), 2153\u20132164 (2004)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"2315_CR52","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1109\/TMI.2021.3054167","volume":"40","author":"J Xiang","year":"2021","unstructured":"Xiang, J., Dong, Y., Yang, Y.: FISTA-net: Learning a fast iterative shrinkage thresholding network for inverse problems in imaging. IEEE Trans. Med. Imag. 40(5), 1329\u20131339 (2021)","journal-title":"IEEE Trans. Med. Imag."},{"issue":"6","key":"2315_CR53","doi-asserted-by":"crossref","first-page":"2627","DOI":"10.1109\/TAC.2019.2942513","volume":"65","author":"R Xin","year":"2020","unstructured":"Xin, R., Khan, U.A.: Distributed heavy-ball: A generalization and acceleration of first-order methods with gradient tracking. IEEE Trans. Auto. Control 65(6), 2627\u20132633 (2020)","journal-title":"IEEE Trans. Auto. Control"},{"issue":"1","key":"2315_CR54","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for $$\\ell _1$$-minimization with applications to compressed sensing. SIAM J. Imag. Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"2315_CR55","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/090760350","volume":"3","author":"W Yin","year":"2010","unstructured":"Yin, W.: Analysis and generalizations of the linearized Bregman method. SIAM J. Imag. Sci. 3(4), 856\u2013877 (2010)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"2315_CR56","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/18M1219187","volume":"30","author":"YB Zhao","year":"2020","unstructured":"Zhao, Y.B.: Optimal $$k$$-thresholding algorithms for sparse optimization problems. SIAM J. Opt. 30(1), 31\u201355 (2020)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"2315_CR57","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/moor.2016.0791","volume":"42","author":"YB Zhao","year":"2017","unstructured":"Zhao, Y.B., Luo, Z.Q.: Constructing new reweighted $$\\ell _1$$-algorithms for the sparsest points of polyhedral sets. Math. Oper. Res. 42(1), 57\u201376 (2017)","journal-title":"Math. Oper. Res."},{"key":"2315_CR58","volume":"187","author":"YB Zhao","year":"2021","unstructured":"Zhao, Y.B., Luo, Z.Q.: Analysis of optimal thresholding algorithms for compressed sensing. Signal Process. 187, 108148 (2021)","journal-title":"Signal Process."},{"key":"2315_CR59","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/OJSP.2022.3195115","volume":"3","author":"YB Zhao","year":"2022","unstructured":"Zhao, Y.B., Luo, Z.Q.: Natural thresholding algorithms for signal recovery with sparsity. IEEE Open J. Signal Process. 3, 417\u2013431 (2022)","journal-title":"IEEE Open J. Signal Process."},{"issue":"5","key":"2315_CR60","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s11425-021-1987-2","volume":"66","author":"YB Zhao","year":"2023","unstructured":"Zhao, Y.B., Luo, Z.Q.: Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms. Sci. China Math. 66(5), 1123\u20131140 (2023)","journal-title":"Sci. China Math."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02315-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02315-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02315-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T11:16:56Z","timestamp":1692616616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02315-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,11]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2315"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02315-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,11]]},"assertion":[{"value":"2 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","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 competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}}],"article-number":"93"}}