{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:25:59Z","timestamp":1769311559720,"version":"3.49.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2208386"],"award-info":[{"award-number":["DMS-2208386"]}],"id":[{"id":"10.13039\/100000001","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":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study <jats:italic>inexact<\/jats:italic> fixed-point proximity algorithms for solving a class of sparse regularization problems involving the <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ell _0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>\u2113<\/mml:mi>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> norm. Specifically, the <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ell _0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>\u2113<\/mml:mi>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> model has an objective function that is the sum of a convex fidelity term and a Moreau envelope of the <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ell _0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>\u2113<\/mml:mi>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> norm regularization term. Such an <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ell _0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>\u2113<\/mml:mi>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> model is non-convex. Existing exact algorithms for solving the problems require the availability of closed-form formulas for the proximity operator of convex functions involved in the objective function. When such formulas are not available, numerical computation of the proximity operator becomes inevitable. This leads to inexact iteration algorithms. We investigate in this paper how the numerical error for every step of the iteration should be controlled to ensure global convergence of the inexact algorithms. We establish a theoretical result that guarantees the sequence generated by the proposed inexact algorithm converges to a local minimizer of the optimization problem. We implement the proposed algorithms for three applications of practical importance in machine learning and image science, which include regression, classification, and image deblurring. The numerical results demonstrate the convergence of the proposed algorithm and confirm that local minimizers of the <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ell _0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>\u2113<\/mml:mi>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> models found by the proposed inexact algorithm outperform global minimizers of the corresponding <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ell _1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>\u2113<\/mml:mi>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> models, in terms of approximation accuracy and sparsity of the solutions.<\/jats:p>","DOI":"10.1007\/s10915-024-02600-7","type":"journal-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:01:50Z","timestamp":1720436510000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Inexact Fixed-Point Proximity Algorithm for the $$\\ell _0$$ Sparse Regularization Problem"],"prefix":"10.1007","volume":"100","author":[{"given":"Ronglong","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuesheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingsong","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,8]]},"reference":[{"key":"2600_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0484-9","journal-title":"Math. Program."},{"key":"2600_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)"},{"key":"2600_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"key":"2600_CR4","doi-asserted-by":"crossref","unstructured":"Boche, H., Calderbank, R., Kutyniok, G., Vyb\u00edral, J.: A survey of compressed sensing. In: Compressed Sensing and its Applications, pp. 1\u201339. Springer, New York (2015)","DOI":"10.1007\/978-3-319-16042-9_1"},{"issue":"1","key":"2600_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011). https:\/\/doi.org\/10.1561\/2200000016","journal-title":"Found. Trends Mach. Learn."},{"key":"2600_CR6","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Candes","year":"2005","unstructured":"Candes, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. 51, 4203\u20134215 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.858979","journal-title":"IEEE Trans. Inf."},{"key":"2600_CR7","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Tao, T.: Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inf. 52, 5406\u20135425 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.885507","journal-title":"IEEE Trans. Inf."},{"key":"2600_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal\u2013dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40, 120\u2013145 (2011). https:\/\/doi.org\/10.1007\/s10851-010-0251-1","journal-title":"J. Math. Imaging Vis."},{"key":"2600_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.acha.2004.02.003","volume":"17","author":"RH Chan","year":"2004","unstructured":"Chan, R.H., Riemenschneider, S.D., Shen, L., Shen, Z.: Tight frame: an efficient way for high-resolution image reconstruction. Appl. Comput. Harmon. Anal. 17, 91\u2013115 (2004). https:\/\/doi.org\/10.1016\/j.acha.2004.02.003","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2600_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. 2, 1\u201327 (2011). https:\/\/doi.org\/10.1145\/1961189.1961199","journal-title":"ACM Trans. Intell."},{"key":"2600_CR11","doi-asserted-by":"publisher","unstructured":"Combettes*, P.L.: Solving monotone inclusions via compositions of non-expansive averaged operators. Optimization 53, 475\u2013504 (2004). https:\/\/doi.org\/10.1080\/02331930412331327157","DOI":"10.1080\/02331930412331327157"},{"key":"2600_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9904-1943-07818-4","volume":"49","author":"R Courant","year":"1943","unstructured":"Courant, R.: Variational methods for the solution of problems of equilibrium and vibrations. Bull. Am. Math. 49, 1\u201323 (1943). (https:\/\/api.semanticscholar.org\/CorpusID:16547277)","journal-title":"Bull. Am. Math."},{"key":"2600_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970104","volume-title":"Ten Lectures on Wavelets","author":"I Daubechies","year":"1992","unstructured":"Daubechies, I.: Ten Lectures on Wavelets. SIAM, Philadelphia (1992)"},{"key":"2600_CR14","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. 52, 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Trans. Inf."},{"key":"2600_CR15","doi-asserted-by":"publisher","unstructured":"Elad, M., Aharon, M.: Image denoising via learned dictionaries and sparse representation. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201906), vol.\u00a01, pp. 895\u2013900. IEEE (2006). https:\/\/doi.org\/10.1109\/CVPR.2006.142","DOI":"10.1109\/CVPR.2006.142"},{"key":"2600_CR16","doi-asserted-by":"publisher","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, 1348\u20131360 (2001). https:\/\/doi.org\/10.1198\/016214501753382273","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"2600_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"2600_CR18","doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. J. Symb. Log. 48 (1983). https:\/\/doi.org\/10.2307\/2273574","DOI":"10.2307\/2273574"},{"key":"2600_CR19","doi-asserted-by":"crossref","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. Revue fran\u00e7aise d\u2019automatique, informatique, recherche op\u00e9rationnelle. Analyse num\u00e9rique 9(R2), 41\u201376 (1975)","DOI":"10.1051\/m2an\/197509R200411"},{"key":"2600_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718874","volume-title":"Deblurring Images: Matrices, Spectra, and Filtering","author":"PC Hansen","year":"2006","unstructured":"Hansen, P.C., Nagy, J.G., O\u2019leary, D.P.: Deblurring Images: Matrices, Spectra, and Filtering. SIAM, Philadelphia (2006)"},{"key":"2600_CR21","doi-asserted-by":"crossref","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. In: Annales de l\u2019institut Fourier, vol. 48, pp. 769\u2013783 (1998)","DOI":"10.5802\/aif.1638"},{"key":"2600_CR22","doi-asserted-by":"publisher","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE. 86, 2278\u20132324 (1998). https:\/\/doi.org\/10.1109\/5.726791","DOI":"10.1109\/5.726791"},{"issue":"11","key":"2600_CR23","doi-asserted-by":"publisher","first-page":"4314","DOI":"10.1109\/TIP.2013.2271852","volume":"22","author":"S Lefkimmiatis","year":"2013","unstructured":"Lefkimmiatis, S., Unser, M.: Poisson image reconstruction with Hessian Schatten-norm regularization. IEEE Trans. Image Process. 22(11), 4314\u20134327 (2013)","journal-title":"IEEE Trans. Image Process."},{"key":"2600_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10444-014-9363-2","volume":"41","author":"Q Li","year":"2015","unstructured":"Li, Q., Shen, L., Xu, Y., Zhang, N.: Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing. Adv. Comput. Math. 41, 387\u2013422 (2015). https:\/\/doi.org\/10.1007\/s10444-014-9363-2","journal-title":"Adv. Comput. Math."},{"key":"2600_CR25","first-page":"154","volume":"15","author":"Z Li","year":"2018","unstructured":"Li, Z., Song, G., Xu, Y.: A fixed-point proximity approach to solving the support vector regression with the group lasso regularization. Int. J. Numer. Anal. Model. 15, 154\u2013169 (2018)","journal-title":"Int. J. Numer. Anal. Model."},{"key":"2600_CR26","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/s10915-019-01045-7","volume":"81","author":"Z Li","year":"2019","unstructured":"Li, Z., Song, G., Xu, Y.: A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning. J. Sci. Comput. 81, 923\u2013940 (2019). https:\/\/doi.org\/10.1007\/s10915-019-01045-7","journal-title":"J. Sci. Comput."},{"key":"2600_CR27","doi-asserted-by":"crossref","unstructured":"Li, Z., Xu, Y., Ye, Q.: Sparse support vector machines in reproducing kernel Banach spaces. In: Contemporary Computational Mathematics\u2014A Celebration of the 80th Birthday of Ian Sloan, pp. 869\u2013887. Springer (2018)","DOI":"10.1007\/978-3-319-72456-0_38"},{"key":"2600_CR28","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1080\/00036811.2010.490524","volume":"90","author":"Q Lian","year":"2011","unstructured":"Lian, Q., Shen, L., Xu, Y., Yang, L.: Filters of wavelets on invariant sets for image denoising. Appl. Anal. 90, 1299\u20131322 (2011). https:\/\/doi.org\/10.1080\/00036811.2010.490524","journal-title":"Appl. Anal."},{"key":"2600_CR29","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-015-0964-4","volume":"159","author":"J Liang","year":"2016","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Convergence rates with inexact non-expansive operators. Math. Program. 159, 403\u2013434 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0964-4","journal-title":"Math. Program."},{"key":"2600_CR30","first-page":"87","volume":"117","author":"S Lojasiewicz","year":"1963","unstructured":"Lojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00e9quations aux d\u00e9riv\u00e9es partielles 117, 87\u201389 (1963)","journal-title":"Les \u00e9quations aux d\u00e9riv\u00e9es partielles"},{"key":"2600_CR31","volume-title":"A Wavelet Tour of Signal Processing","author":"S Mallat","year":"1999","unstructured":"Mallat, S.: A Wavelet Tour of Signal Processing. Elsevier, Amsterdam (1999)"},{"key":"2600_CR32","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/4\/045009","volume":"27","author":"CA Micchelli","year":"2011","unstructured":"Micchelli, C.A., Shen, L., Xu, Y.: Proximity algorithms for image models: denoising. Inverse Probl. 27, 045009 (2011). https:\/\/doi.org\/10.1088\/0266-5611\/27\/4\/045009","journal-title":"Inverse Probl."},{"key":"2600_CR33","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24, 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"2600_CR34","unstructured":"Ren, J., Xu, Y.: Inexact fixed-point iterations with applications to convex optimization (2023, preprint)"},{"key":"2600_CR35","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14, 877\u2013898 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control. Optim."},{"key":"2600_CR36","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1006\/jfan.1996.3079","volume":"148","author":"A Ron","year":"1997","unstructured":"Ron, A., Shen, Z.: Affine systems in$${L}_2(\\mathbb{R} ^d)$$: the analysis of the analysis operator. J. Funct. Anal. 148, 408\u2013447 (1997). https:\/\/doi.org\/10.1006\/jfan.1996.3079","journal-title":"J. Funct. Anal."},{"key":"2600_CR37","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.acha.2015.03.001","volume":"41","author":"L Shen","year":"2016","unstructured":"Shen, L., Xu, Y., Zeng, X.: Wavelet inpainting with the $$\\ell _0$$ sparse regularization. Appl. Comput. Harmon. Anal. 41, 26\u201353 (2016). https:\/\/doi.org\/10.1016\/j.acha.2015.03.001","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"2600_CR38","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.acha.2013.11.002","volume":"37","author":"L Shen","year":"2014","unstructured":"Shen, L., Xu, Y., Zhang, N.: An approximate sparsity model for inpainting. Appl. Comput. Harmon. Anal. 37(1), 171\u2013184 (2014). https:\/\/doi.org\/10.1016\/j.acha.2013.11.002","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2600_CR39","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7, 323\u2013345 (1999). https:\/\/doi.org\/10.1023\/A:1008777829180","journal-title":"Set-Valued Anal."},{"key":"2600_CR40","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.acha.2012.03.009","volume":"34","author":"G Song","year":"2013","unstructured":"Song, G., Zhang, H., Hickernell, F.J.: Reproducing kernel Banach spaces with the $$\\ell _1$$ norm. Appl. Comput. Harmon. Anal. 34, 96\u2013116 (2013)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"2600_CR41","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/S0036144598336745","volume":"41","author":"G Strang","year":"1999","unstructured":"Strang, G.: The discrete cosine transform. SIAM Rev. 41, 135\u2013147 (1999)","journal-title":"SIAM Rev."},{"key":"2600_CR42","volume-title":"Multirate and Wavelet Signal Processing","author":"BW Suter","year":"1998","unstructured":"Suter, B.W.: Multirate and Wavelet Signal Processing. Academic Press, San Diego (1998)"},{"issue":"7","key":"2600_CR43","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1109\/TSP.2014.2304932","volume":"62","author":"Z Tan","year":"2014","unstructured":"Tan, Z., Eldar, Y.C., Beck, A., Nehorai, A.: Smoothing and decomposition for analysis sparse recovery. IEEE Trans. Signal Process. 62(7), 1762\u20131774 (2014). https:\/\/doi.org\/10.1109\/TSP.2014.2304932","journal-title":"IEEE Trans. Signal Process."},{"key":"2600_CR44","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23, 1607\u20131633 (2013). https:\/\/doi.org\/10.1137\/110844805","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2600_CR45","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/080724265","volume":"1","author":"Y Wang","year":"2008","unstructured":"Wang, Y., Yang, J., Yin, W., Zhang, Y.: A new alternating minimization algorithm for total variation image reconstruction. SIAM J. Imaging Sci. 1(3), 248\u2013272 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"2600_CR46","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex non-smooth optimization. J. Sci. Comput. 78, 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"key":"2600_CR47","doi-asserted-by":"crossref","unstructured":"Willett, R.M., Harmany, Z.T., Marcia, R.F.: Poisson image reconstruction with total variation regularization. In: 2010 Proceedings of the IEEE International Conference on Image Processing, pp. 4177\u20134180. IEEE (2010)","DOI":"10.1109\/ICIP.2010.5649600"},{"key":"2600_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-022-01906-8","volume":"92","author":"T Wu","year":"2022","unstructured":"Wu, T., Xu, Y.: Inverting incomplete Fourier transforms by a sparse regularization model and applications in seismic wavefield modeling. J. Sci. Comput. 92, 1\u201335 (2022)","journal-title":"J. Sci. Comput."},{"key":"2600_CR49","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.apnum.2023.02.011","volume":"187","author":"Y Xu","year":"2023","unstructured":"Xu, Y.: Sparse machine learning in Banach spaces. Appl. Numer. Math. 187, 138\u2013157 (2023). https:\/\/doi.org\/10.1016\/j.apnum.2023.02.011","journal-title":"Appl. Numer. Math."},{"key":"2600_CR50","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1142\/S0219530522500105","volume":"21","author":"Y Xu","year":"2023","unstructured":"Xu, Y.: Sparse regularization with the $$\\ell _0$$ norm. Anal. Appl. 21, 901\u2013929 (2023). https:\/\/doi.org\/10.1142\/S0219530522500105","journal-title":"Anal. Appl."},{"key":"2600_CR51","doi-asserted-by":"crossref","unstructured":"Zeng, X., Shen, L., Xu, Y.: A convergent fixed-point proximity algorithm accelerated by FISTA for the $$\\ell _0$$ sparse recovery problem. In: International Conference on Imaging. Vision and Learning Based on Optimization and PDEs, pp. 27\u201345. Springer, New York (2016)","DOI":"10.1007\/978-3-319-91274-5_2"},{"issue":"11","key":"2600_CR52","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ab23da","volume":"35","author":"W Zheng","year":"2019","unstructured":"Zheng, W., Li, S., Krol, A., Schmidtlein, C.R., Zeng, X., Xu, Y.: Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction. Inverse Probl. 35(11), 115011 (2019). https:\/\/doi.org\/10.1088\/1361-6420\/ab23da","journal-title":"Inverse Probl."},{"key":"2600_CR53","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H Zou","year":"2006","unstructured":"Zou, H.: The adaptive lasso and its oracle properties. J. Am. Stat. Assoc. 101, 1418\u20131429 (2006). https:\/\/doi.org\/10.1198\/016214506000000735","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02600-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02600-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02600-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T12:23:05Z","timestamp":1721132585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02600-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2600"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02600-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"18 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 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":"58"}}