{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:52:03Z","timestamp":1779400323578,"version":"3.53.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:00:00Z","timestamp":1616544000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:00:00Z","timestamp":1616544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s11075-021-01085-x","type":"journal-article","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T11:03:56Z","timestamp":1616583836000},"page":"1541-1570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Newton method for \u21130-regularized optimization"],"prefix":"10.1007","volume":"88","author":[{"given":"Shenglong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lili","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,24]]},"reference":[{"issue":"1-2","key":"1085_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(1-2), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"Mar","key":"1085_CR2","first-page":"807","volume":"14","author":"S Bahmani","year":"2013","unstructured":"Bahmani, S., Raj, B., Boufounos, P.T.: Greedy sparsity constrained optimization. J. Mach. Learn. Res. 14(Mar), 807\u2013841 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"11","key":"1085_CR3","doi-asserted-by":"publisher","first-page":"115004","DOI":"10.1088\/0266-5611\/32\/11\/115004","volume":"32","author":"C Bao","year":"2016","unstructured":"Bao, C., Dong, B., Hou, L., Shen, Z., Zhang, X., Zhang, X.: Image restoration by minimizing zero norm of wavelet frame coefficients. Inv. Probl. 32(11), 115004 (2016)","journal-title":"Inv. Probl."},{"issue":"3","key":"1085_CR4","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: Optimality conditions and algorithms. SIAM J. Optim. 23(3), 1480\u20131509 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1085_CR5","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/17M1116544","volume":"28","author":"A Beck","year":"2018","unstructured":"Beck, A., Hallak, N.: Proximal mapping for symmetric penalty and sparsity. SIAM J. Optim. 28(1), 496\u2013527 (2018)","journal-title":"SIAM J. Optim."},{"key":"1085_CR6","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat., 813\u2013852 (2016)","DOI":"10.1214\/15-AOS1388"},{"issue":"3","key":"1085_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TNNLS.2011.2181867","volume":"23","author":"W Bian","year":"2012","unstructured":"Bian, W., Chen, X.: Smoothing neural network for constrained non-Lipschitz optimization with applications. IEEE Transactions on Neural Networks and Learning Systems 23(3), 399\u2013411 (2012)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"4","key":"1085_CR8","doi-asserted-by":"publisher","first-page":"2294","DOI":"10.1137\/140985639","volume":"8","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X.: Linearly constrained non-Lipschitz optimization for image restoration. SIAM Journal on Imaging Sciences 8(4), 2294\u20132322 (2015)","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"1","key":"1085_CR9","doi-asserted-by":"publisher","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":"4","key":"1085_CR10","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. Information and Inference: A Journal of the IMA 4(4), 289\u2013327 (2015)","journal-title":"Information and Inference: A Journal of the IMA"},{"issue":"3","key":"1085_CR11","doi-asserted-by":"publisher","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."},{"issue":"6","key":"1085_CR12","doi-asserted-by":"publisher","first-page":"2370","DOI":"10.1109\/TSP.2007.916124","volume":"56","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Gradient pursuits. IEEE Trans. Signal Process. 56(6), 2370\u20132382 (2008)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5-6","key":"1085_CR13","doi-asserted-by":"publisher","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. Journal of Fourier analysis and Applications 14(5-6), 629\u2013654 (2008)","journal-title":"Journal of Fourier analysis and Applications"},{"issue":"2","key":"1085_CR14","doi-asserted-by":"publisher","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 Journal of Selected Topics in Signal Processing 4(2), 298\u2013309 (2010)","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"2","key":"1085_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E. J., 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":"12","key":"1085_CR16","doi-asserted-by":"publisher","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. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1085_CR17","doi-asserted-by":"publisher","first-page":"4709","DOI":"10.1109\/TIP.2012.2214051","volume":"21","author":"X Chen","year":"2012","unstructured":"Chen, X., Ng, M.K., Zhang, C.: Non-Lipschitz \u2113p-regularization and box constrained model for image restoration. IEEE Trans. Image Process. 21(12), 4709\u20134721 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"1085_CR18","doi-asserted-by":"crossref","unstructured":"Cheng, W., Chen, Z., Hu, Q.: An active set Barzilar-Borwein algorithm for \u21130 regularized optimization Journal of Global Optimization (2019)","DOI":"10.1007\/s10898-019-00830-w"},{"key":"1085_CR19","doi-asserted-by":"crossref","unstructured":"Cottle, R.W.: Linear complementarity problem Springer (2009)","DOI":"10.1137\/1.9780898719000"},{"issue":"5","key":"1085_CR20","doi-asserted-by":"publisher","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 transactions on Information Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE transactions on Information Theory"},{"issue":"3","key":"1085_CR21","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02592192","volume":"75","author":"T De Luca","year":"1996","unstructured":"De Luca, T., Facchinei, F., Kanzow, C.: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75(3), 407\u2013439 (1996)","journal-title":"Math. Program."},{"key":"1085_CR22","doi-asserted-by":"crossref","unstructured":"Dinh, T., Wang, B., Bertozzi, A.L., Osher, S.J., Xin, J.: Sparsity meets robustness: channel pruning for the feynman-kac formalism principled robust deep neural nets. arXiv:2003.00631 (2020)","DOI":"10.1007\/978-3-030-64580-9_31"},{"issue":"4","key":"1085_CR23","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. Theory 52 (4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1085_CR24","doi-asserted-by":"crossref","unstructured":"Elad, M.: Sparse and redundant representations: from theory to applications in signal and image processing Springer Science & Business Media (2010)","DOI":"10.1007\/978-1-4419-7011-4"},{"issue":"6","key":"1085_CR25","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/JPROC.2009.2037655","volume":"98","author":"M Elad","year":"2010","unstructured":"Elad, M., Figueiredo, M.A., Ma, Y.: On the role of sparse and redundant representations in image processing. Proc. IEEE 98(6), 972\u2013982 (2010)","journal-title":"Proc. IEEE"},{"issue":"3","key":"1085_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0167-6377(94)00059-F","volume":"17","author":"F Facchinei","year":"1995","unstructured":"Facchinei, F.: Minimization of sc1 functions and the maratos effect. Oper. Res. Lett. 17(3), 131\u2013138 (1995)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1085_CR27","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/BF02614395","volume":"76","author":"F Facchinei","year":"1997","unstructured":"Facchinei, F., Kanzow, C.: A nonsmooth inexact newton method for the solution of large-scale nonlinear complementarity problems. Math. Program. 76 (3), 493\u2013512 (1997)","journal-title":"Math. Program."},{"issue":"6","key":"1085_CR28","doi-asserted-by":"publisher","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."},{"issue":"1","key":"1085_CR29","first-page":"403","volume":"19","author":"J Huang","year":"2018","unstructured":"Huang, J., Jiao, Y., Liu, Y., Lu, X.: A constructive approach to l0 penalized regression. J. Mach. Learn. Res. 19(1), 403\u2013439 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1085_CR30","doi-asserted-by":"publisher","first-page":"015001","DOI":"10.1088\/0266-5611\/30\/1\/015001","volume":"30","author":"K Ito","year":"2013","unstructured":"Ito, K., Kunisch, K.: A variational approach to sparsity optimization based on lagrange multiplier theory. Inv. Probl. 30(1), 015001 (2013)","journal-title":"Inv. Probl."},{"issue":"3","key":"1085_CR31","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.acha.2014.10.001","volume":"39","author":"Y Jiao","year":"2015","unstructured":"Jiao, Y., Jin, B., Lu, X.: A primal dual active set with continuation algorithm for the \u21130-regularized optimization problem. Appl. Comput. Harmon. Anal. 39(3), 400\u2013426 (2015)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"1085_CR32","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed \u2113q minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"1085_CR33","doi-asserted-by":"crossref","unstructured":"Lin, S., Ji, R., Li, Y., Deng, C., Li, X.: Toward compact convnets via structure-sparsity regularized filter pruning. IEEE Trans. Neural Netw. Learn. Syst. (2019)","DOI":"10.1109\/TNNLS.2019.2906563"},{"issue":"2","key":"1085_CR34","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, M.: Fast l1 \u2212 l2 minimization via a proximal operator. J. Sci. Comput. 74(2), 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"issue":"1-2","key":"1085_CR35","doi-asserted-by":"publisher","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 \u21130 regularized convex cone programming. Math. Program. 147(1-2), 125\u2013154 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"1085_CR36","doi-asserted-by":"publisher","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":"3","key":"1085_CR37","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J. J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4(3), 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3","key":"1085_CR38","doi-asserted-by":"publisher","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":"2","key":"1085_CR39","first-page":"325","volume":"13","author":"L Pan","year":"2017","unstructured":"Pan, L., Zhou, S., Xiu, N., Qi, H.D.: A convergent iterative hard thresholding for nonnegative sparsity optimization. Pacific J. Optim. 13 (2), 325\u2013353 (2017)","journal-title":"Pacific J. Optim."},{"key":"1085_CR40","unstructured":"Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In: Signals, Systems and Computers, 1993. 1993 Conference Record of the Twenty-Seventh Asilomar Conference on, pp 40\u201344. IEEE (1993)"},{"key":"1085_CR41","doi-asserted-by":"crossref","unstructured":"Patrascu, A., Necoara, I., Patrinos, P.: A proximal alternating minimization method for \u21130-regularized nonlinear optimization problems: Application to state estimation. In: Proceedings of the IEEE Conference on Decision and Control, vol. 2015, pp 4254\u20134259 (2015)","DOI":"10.1109\/CDC.2014.7040052"},{"issue":"3","key":"1085_CR42","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10957-014-0549-z","volume":"163","author":"M Shang","year":"2014","unstructured":"Shang, M., Zhang, C., Xiu, N.: Minimal zero norm solutions of linear complementarity problems. J. Optim. Theory Appl. 163(3), 795\u2013814 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1085_CR43","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1186\/s13660-015-0551-5","volume":"2015","author":"M Shang","year":"2015","unstructured":"Shang, M., Zhou, S., Xiu, N.: Extragradient thresholding methods for sparse solutions of co-coercive ncps. J. Inequal. Appl. 2015(1), 34 (2015)","journal-title":"J. Inequal. Appl."},{"issue":"3","key":"1085_CR44","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/151003714","volume":"8","author":"E Soubies","year":"2015","unstructured":"Soubies, E., Blanc-F\u00e9raud, L., Aubert, G.: A continuous exact \u21130 penalty (cel0) for least squares regularized problem. SIAM J. Imaging Sci. 8(3), 1607\u20131639 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"13","key":"1085_CR45","doi-asserted-by":"publisher","first-page":"3301","DOI":"10.1109\/TSP.2015.2421476","volume":"63","author":"C Soussen","year":"2015","unstructured":"Soussen, C., Idier, J., Duan, J., Brie, D.: Homotopy based algorithms for \u21130-regularized least squares. IEEE Trans. Signal Process. 63(13), 3301\u20133316 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1085_CR46","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A.: Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Trans. Inf. Theory 52(3), 1030\u20131051 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1085_CR47","doi-asserted-by":"publisher","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. Inf. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1085_CR48","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/JPROC.2010.2044470","volume":"98","author":"J Wright","year":"2010","unstructured":"Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T.S., Yan, S.: Sparse representation for computer vision and pattern recognition. Proc. IEEE 98(6), 1031\u20131044 (2010)","journal-title":"Proc. IEEE"},{"issue":"1","key":"1085_CR49","first-page":"89","volume":"4","author":"J Xie","year":"2008","unstructured":"Xie, J., He, S., Zhang, S.: Randomized portfolio selection with constraints. Pacific J. Optim. 4(1), 89\u2013112 (2008)","journal-title":"Pacific J. Optim."},{"issue":"1","key":"1085_CR50","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of 1-2 for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1085_CR51","first-page":"6027","volume":"18","author":"XT Yuan","year":"2017","unstructured":"Yuan, X.T., Li, P., Zhang, T.: Gradient hard thresholding pursuit. J. Mach. Learn. Res. 18(1), 6027\u20136069 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1085_CR52","doi-asserted-by":"crossref","unstructured":"Yuan, X.T., Liu, Q.: Newton greedy pursuit: A quadratic approximation method for sparsity-constrained optimization. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 4122\u20134129 (2014)","DOI":"10.1109\/CVPR.2014.525"},{"issue":"10","key":"1085_CR53","doi-asserted-by":"publisher","first-page":"4349","DOI":"10.1109\/TIP.2012.2205006","volume":"21","author":"XT Yuan","year":"2012","unstructured":"Yuan, X.T., Liu, X., Yan, S.: Visual classification with multitask joint sparse representation. IEEE Trans. Image Process. 21(10), 4349\u20134360 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"1085_CR54","doi-asserted-by":"crossref","unstructured":"Zhou, S., Shang, M., Pan, L., Li, M.: Newton hard thresholding pursuit for sparse lcp via a new merit function. arXiv:2004.02244 (2020)","DOI":"10.1137\/19M1301539"},{"issue":"12","key":"1085_CR55","first-page":"1","volume":"22","author":"S Zhou","year":"2021","unstructured":"Zhou, S., Xiu, N., Qi, H.D.: Global and quadratic convergence of Newton hard-thresholding pursuit. J. Mach. Learn. Res. 22(12), 1\u201345 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1085_CR56","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imaiai\/iaw002","volume":"5","author":"S Zhou","year":"2016","unstructured":"Zhou, S., Xiu, N., Wang, Y., Kong, L., Qi, H.D.: A null-space-based weighted \u21131 minimization approach to compressed sensing. Inf. Inference 5(1), 76\u2013102 (2016)","journal-title":"Inf. Inference"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01085-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01085-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01085-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T07:32:37Z","timestamp":1675063957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01085-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,24]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1085"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01085-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,24]]},"assertion":[{"value":"14 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}