{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T03:10:56Z","timestamp":1792638656969,"version":"4.5.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"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":["12271127"],"award-info":[{"award-number":["12271127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176073"],"award-info":[{"award-number":["62176073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2021YFA1003500"],"award-info":[{"award-number":["2021YFA1003500"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2022FRFK0600XX"],"award-info":[{"award-number":["2022FRFK0600XX"]}],"id":[{"id":"10.13039\/501100012226","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,8]]},"DOI":"10.1007\/s10915-023-02249-8","type":"journal-article","created":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T06:02:10Z","timestamp":1686808930000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Accelerated Smoothing Hard Thresholding Algorithms for $$\\ell _0$$ Regularized Nonsmooth Convex Regression Problem"],"prefix":"10.1007","volume":"96","author":[{"given":"Wei","family":"Bian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"issue":"3","key":"2249_CR1","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1137\/19M1307779","volume":"30","author":"S Adly","year":"2020","unstructured":"Adly, S., Attouch, H.: Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping. SIAM J. Optim. 30(3), 2134\u20132162 (2020)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2249_CR2","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1007\/s00245-020-09692-1","volume":"84","author":"CD Alecsa","year":"2021","unstructured":"Alecsa, C.D., L\u00e1szl\u00f3, S.C., Pin\u0163a, T.: An extension of the second order dynamical system that model Nesterov\u2019s convex gradient method. Appl. Math. Optim. 84(2), 1687\u20131716 (2021)","journal-title":"Appl. Math. Optim."},{"key":"2249_CR3","doi-asserted-by":"crossref","unstructured":"Attouch, H., L\u00e1szl\u00f3, S.: Newton-like inertial dynamics and proximal algorithms governed by maximally monotone operators. SIAM J. Optim. 30(4), 3252\u20133283 (2020)","DOI":"10.1137\/20M1333316"},{"issue":"3","key":"2249_CR4","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than $$1\/k^2$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2249_CR5","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. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"2249_CR6","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"2249_CR7","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1360\/SSM-2020-0181","volume":"50","author":"W Bian","year":"2020","unstructured":"Bian, W.: Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems (in chinese). Sci. Sin. Math. 50, 1651\u20131666 (2020)","journal-title":"Sci. Sin. Math."},{"issue":"4","key":"2249_CR8","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1287\/moor.2016.0837","volume":"42","author":"W Bian","year":"2017","unstructured":"Bian, W., Chen, X.: Optimality and complexity for constrained optimization problems with nonconvex regularization. Math. Oper. Res. 42(4), 1063\u20131084 (2017)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2249_CR9","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1\u20132","key":"2249_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X., Ye, Y.Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. 149(1\u20132), 301\u2013327 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"2249_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/TSA.2005.860346","volume":"14","author":"T Blumensath","year":"2006","unstructured":"Blumensath, T., Davies, M.: Sparse and shift-invariant representations of music. IEEE Trans. Audio Speech Lang. Process. 14(1), 50\u201357 (2006)","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"issue":"5\u20136","key":"2249_CR12","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.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14(5\u20136), 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"2249_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2249_CR14","doi-asserted-by":"publisher","unstructured":"Bo\u0163, R.I., B\u00f6hm, A.: Variable smoothing for convex optimization problems using stochastic gradients. J. Sci. Comput. https:\/\/doi.org\/10.1007\/s10915-020-01332-8 (2020)","DOI":"10.1007\/s10915-020-01332-8"},{"issue":"1","key":"2249_CR15","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"A Bruckstein","year":"2009","unstructured":"Bruckstein, A., Donoho, D., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1), 34\u201381 (2009)","journal-title":"SIAM Rev."},{"issue":"2","key":"2249_CR16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2249_CR17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/83.661182","volume":"7","author":"A Chambolle","year":"1998","unstructured":"Chambolle, A., DeVore, R., Lee, N., Lucier, B.: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEE Trans. Image Process. 7(3), 319\u2013335 (1998)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"2249_CR18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134(1), 71\u201399 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"2249_CR19","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P Combettes","year":"2005","unstructured":"Combettes, P., Wajs, V.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"5","key":"2249_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. Inf. Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2249_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. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"issue":"4","key":"2249_CR22","doi-asserted-by":"crossref","first-page":"3146","DOI":"10.1137\/19M130769X","volume":"30","author":"N Doikov","year":"2020","unstructured":"Doikov, N., Nesterov, Y.: Contracting proximal methods for smooth convex optimization. SIAM J. Optim. 30(4), 3146\u20133169 (2020)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2249_CR23","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"456","key":"2249_CR24","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"2249_CR25","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"E Hale","year":"2008","unstructured":"Hale, E., Yin, W., Zhang, Y.: Fixed-point continuation for $$\\ell _1$$-minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2249_CR26","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/moor.1100.0452","volume":"35","author":"S Hoda","year":"2010","unstructured":"Hoda, S., Gilpin, A., Pena, J., Sandholm, T.: Smoothing techniques for computing Nash equilibria of sequential games. Math. Oper. Res. 35(2), 494\u2013512 (2010)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2249_CR27","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1198\/106186007X255676","volume":"16","author":"Y Liu","year":"2007","unstructured":"Liu, Y., Wu, Y.: Variable selection via a combination of the $$\\ell _0$$ and $$\\ell _1$$ penalties. J. Comput. Graph. Stat. 16(4), 782\u2013798 (2007)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1\u20132","key":"2249_CR28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-013-0714-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative hard thresholding methods for $$\\ell _0$$ regularized convex cone programming. Math. Program. 147(1\u20132), 125\u2013154 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"2249_CR29","doi-asserted-by":"crossref","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"2249_CR30","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41(12), 3397\u20133415 (1993)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2249_CR31","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"2249_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"2249_CR33","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/S0036139997327794","volume":"61","author":"M Nikolova","year":"2000","unstructured":"Nikolova, M.: Local strong homogeneity of a regularized estimator. SIAM J. Appl. Math. 61(2), 633\u2013658 (2000)","journal-title":"SIAM J. Appl. Math."},{"key":"2249_CR34","unstructured":"Pati, Y., Rezaiifar, R., Krishnaprasad, P.: Orthogonal matching pursuit-recursive function approximation with applications to wavelet decomposition. In: Conference Record of the Twenty-Seventh Asilomar Conference on Signal, Systems and Computers, vol. 1\u20132, pp. 40\u201344 (1993)"},{"issue":"2","key":"2249_CR35","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.sigpro.2007.08.015","volume":"88","author":"D Peleg","year":"2008","unstructured":"Peleg, D., Meir, R.: A bilinear formulation for vector sparsity optimization. Signal Process. 88(2), 375\u2013389 (2008)","journal-title":"Signal Process."},{"issue":"3","key":"2249_CR36","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1137\/151003714","volume":"8","author":"E Soubies","year":"2015","unstructured":"Soubies, E., Blanc-Feraud, L., Aubert, G.: A continuous exact $$\\ell _0$$ penalty (CEL0) for least squares regularized problem. SIAM J. Imaging Sci. 8(3), 1607\u20131639 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"153","key":"2249_CR37","first-page":"1","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Cand\u00e8s, E.: 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":"4","key":"2249_CR38","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1080\/10556788.2020.1713779","volume":"35","author":"CH Tan","year":"2020","unstructured":"Tan, C.H., Qian, Y.Q., Ma, S.Q., Zhang, T.: Accelerated dual-averaging primal-dual method for composite convex minimization. Optim. Method Softw. 35(4), 741\u2013766 (2020)","journal-title":"Optim. Method Softw."},{"issue":"1","key":"2249_CR39","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. R. Stat. Soc. Ser. B-Methodol. 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B-Methodol."},{"issue":"1","key":"2249_CR40","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27(1), 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2249_CR41","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10898-019-00789-8","volume":"75","author":"B Wen","year":"2019","unstructured":"Wen, B., Xue, X.P.: On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems. J. Glob. Optim. 75(3), 767\u2013787 (2019)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"2249_CR42","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1007\/s10898-019-00826-6","volume":"76","author":"F Wu","year":"2020","unstructured":"Wu, F., Bian, W.: Accelerated iterative hard thresholding algorithm for $$\\ell _0$$ regularized regression problem. J. Glob. Optim. 76(4), 819\u2013840 (2020)","journal-title":"J. Glob. Optim."},{"key":"2249_CR43","unstructured":"Wu, F., Bian, W.: Accelerated forward-backward method with fast convergence rate for nonsmooth convex optimization beyond differentiability. arXiv:2110.01454v1 (2021)"},{"issue":"2","key":"2249_CR44","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s10589-021-00337-9","volume":"81","author":"Q Yu","year":"2022","unstructured":"Yu, Q., Zhang, X.Z.: A smoothing proximal gradient algorithm for matrix rank minimization problem. Comput. Optim. Appl. 81(2), 519\u2013538 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2249_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/18M119611X","volume":"30","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Chen, X.: A smoothing active set method for linearly constrained non-Lipschitz nonconvex optimization. SIAM J. Optim. 30(1), 1\u201330 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2249_CR46","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1111\/rssb.12037","volume":"76","author":"Z Zheng","year":"2014","unstructured":"Zheng, Z., Fan, Y., Lv, J.: High dimensional thresholded regression and shrinkage effect. J. R. Stat. Soc. Ser. B-Stat. Methodol. 76(3), 627\u2013649 (2014)","journal-title":"J. R. Stat. Soc. Ser. B-Stat. Methodol."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02249-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02249-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02249-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T08:57:07Z","timestamp":1729587427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02249-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,15]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2249"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02249-8","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,15]]},"assertion":[{"value":"30 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 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 not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"33"}}