{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T14:04:46Z","timestamp":1772633086721,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T00:00:00Z","timestamp":1769990400000},"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":["12071032"],"award-info":[{"award-number":["12071032"]}],"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":[[2026,3]]},"DOI":"10.1007\/s10915-026-03196-w","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T10:47:51Z","timestamp":1770029271000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subspace Newton\u2019s Method for $$\\ell _0$$-Regularized Optimization Problems with Box Constraints"],"prefix":"10.1007","volume":"106","author":[{"given":"Yuge","family":"Ye","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1397-6200","authenticated-orcid":false,"given":"Qingna","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"issue":"2","key":"3196_CR1","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":"3196_CR2","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.858979","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"3196_CR3","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"},{"issue":"6","key":"3196_CR4","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":"10","key":"3196_CR5","doi-asserted-by":"publisher","first-page":"4349","DOI":"10.1109\/TIP.2012.2205006","volume":"21","author":"X-T 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."},{"issue":"3","key":"3196_CR6","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"},{"key":"3196_CR7","doi-asserted-by":"crossref","unstructured":"Dinh, T., Wang, B., Bertozzi, A., Osher, S., Xin, J.: Sparsity meets robustness: Channel pruning for the feynman-kac formalism principled robust deep neural nets. In: Machine Learning, Optimization, and Data Science: 6th International Conference, LOD 2020, Siena, Italy, July 19\u201323, (2020), Revised Selected Papers, Part II 6, pp. 362\u2013381 (2020). Springer","DOI":"10.1007\/978-3-030-64580-9_31"},{"issue":"2","key":"3196_CR8","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1109\/TNNLS.2019.2906563","volume":"31","author":"S Lin","year":"2019","unstructured":"Lin, S., Ji, R., Li, Y., Deng, C., Li, X.: Toward compact convnets via structure-sparsity regularized filter pruning. IEEE transactions on neural networks and learning systems 31(2), 574\u2013588 (2019)","journal-title":"IEEE transactions on neural networks and learning systems"},{"issue":"4","key":"3196_CR9","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 J. Imag. Sci. 8(4), 2294\u20132322 (2015)","journal-title":"SIAM J. Imag. Sci."},{"issue":"12","key":"3196_CR10","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 $$\\ell _p$$-regularization and box constrained model for image restoration. IEEE Trans. Image Process. 21(12), 4709\u20134721 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"3196_CR11","doi-asserted-by":"crossref","unstructured":"Elad, M.: Sparse and Redundant Representations: from Theory to Applications in Signal and Image Processing. Springer, New York, NY, USA (2010)","DOI":"10.1007\/978-1-4419-7011-4"},{"issue":"6","key":"3196_CR12","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":"6","key":"3196_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Cand\u00e8s","year":"2012","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55(6), 111\u2013119 (2012). https:\/\/doi.org\/10.1145\/2184319.2184343","journal-title":"Commun. ACM"},{"issue":"4","key":"3196_CR14","doi-asserted-by":"publisher","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 $$l_0$$ and $$l_1$$ penalties. J. Comput. Graph. Stat. 16(4), 782\u2013798 (2007)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"3196_CR15","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/TSA.2005.860346","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"issue":"1","key":"3196_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"2018","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. Roy. Stat. Soc.: Ser. B (Methodol.) 58(1), 267\u2013288 (2018). https:\/\/doi.org\/10.1111\/j.2517-6161.1996.tb02080.x","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"key":"3196_CR17","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. J. Fourier Anal. Appl. 14, 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"3196_CR18","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-backward splitting, and regularized gauss-seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"3196_CR19","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens (2016)","DOI":"10.1214\/15-AOS1388"},{"issue":"4","key":"3196_CR20","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s10898-019-00830-w","volume":"76","author":"W Cheng","year":"2020","unstructured":"Cheng, W., Chen, Z., Hu, Q.: An active set barzilar-borwein algorithm for $$\\ell _0$$ regularized optimization. J. Global Optim. 76(4), 769\u2013791 (2020)","journal-title":"J. Global Optim."},{"issue":"1","key":"3196_CR21","doi-asserted-by":"publisher","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. Inverse Prob. 30(1), 015001 (2013). https:\/\/doi.org\/10.1088\/0266-5611\/30\/1\/015001","journal-title":"Inverse Prob."},{"issue":"10","key":"3196_CR22","first-page":"1","volume":"19","author":"J Huang","year":"2018","unstructured":"Huang, J., Jiao, Y., Liu, Y., Lu, X.: A constructive approach to $$l_0$$ penalized regression. J. Mach. Learn. Res. 19(10), 1\u201337 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"12","key":"3196_CR23","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":"4","key":"3196_CR24","doi-asserted-by":"publisher","first-page":"3184","DOI":"10.1137\/21M1409445","volume":"31","author":"S Zhou","year":"2021","unstructured":"Zhou, S., Pan, L., Xiu, N., Qi, H.-D.: Quadratic convergence of smoothing newton\u2019s method for 0\/1 loss optimization. SIAM J. Optim. 31(4), 3184\u20133211 (2021)","journal-title":"SIAM J. Optim."},{"key":"3196_CR25","doi-asserted-by":"crossref","unstructured":"Zhou, S., Pan, L., Xiu, N.: Newton method for $$\\ell _0$$-regularized optimization. Numerical Algorithms, 1\u201330 (2021)","DOI":"10.1007\/s11075-021-01085-x"},{"key":"3196_CR26","doi-asserted-by":"publisher","unstructured":"Ye, Y., Li, Q.: Modified block newton algorithm for $$\\ell _0$$-regularized optimization. Optimization 0(0), 1\u201324 (2025) https:\/\/doi.org\/10.1080\/02331934.2025.2574469","DOI":"10.1080\/02331934.2025.2574469"},{"issue":"1","key":"3196_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s11590-014-0757-3","volume":"9","author":"G Liuzzi","year":"2015","unstructured":"Liuzzi, G., Rinaldi, F.: Solving $$\\ell _0$$-penalized problems with simple constraints via the frank-wolfe reduced dimension method. Optimization Letters 9(1), 57\u201374 (2015)","journal-title":"Optimization Letters"},{"key":"3196_CR28","unstructured":"Wu, F., Bian, W., Xue, X.: Smoothing fast iterative hard thresholding algorithm for $$\\ell _0 $$ regularized nonsmooth convex regression problem. arXiv preprint arXiv:2104.13107 (2021)"},{"key":"3196_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11425-015-5038-9","volume":"58","author":"Z Zhao","year":"2015","unstructured":"Zhao, Z., Xu, F., Li, X.: Adaptive projected gradient thresholding methods for constrained $$\\ell _0$$ problems. SCIENCE CHINA Math. 58, 1\u201320 (2015)","journal-title":"SCIENCE CHINA Math."},{"issue":"1","key":"3196_CR30","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). https:\/\/doi.org\/10.1137\/18M1186009","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"3196_CR31","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 $$\\ell _0$$ regularized convex cone programming. Math. Program. 147(1), 125\u2013154 (2014)","journal-title":"Math. Program."},{"key":"3196_CR32","doi-asserted-by":"publisher","unstructured":"Li, W., Bian, W.: Smoothing neural network for $$l_0$$ regularized optimization problem with general convex constraints. Neural Networks 143, 678\u2013689 (2021) https:\/\/doi.org\/10.1016\/j.neunet.2021.08.001","DOI":"10.1016\/j.neunet.2021.08.001"},{"issue":"2","key":"3196_CR33","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10915-018-0874-8","volume":"79","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Zhang, X.: A new proximal iterative hard thresholding method with extrapolation for $$\\ell _0$$minimization. J. Sci. Comput. 79(2), 809\u2013826 (2019)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"3196_CR34","doi-asserted-by":"publisher","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. Global Optim. 76(4), 819\u2013840 (2020)","journal-title":"J. Global Optim."},{"key":"3196_CR35","unstructured":"Ye, Y., Li, Q.: Proximal iterative hard thresholding algorithm for sparse group $$\\ell _0$$-regularized optimization with box constraints. arXiv preprint arXiv:2506.00196 (2025)"},{"key":"3196_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, P., Xiu, N., Qi, H.: Composite optimization with indicator functions: stationary duality and a semismooth newton method. Mathematical Programming (2025)","DOI":"10.1007\/s10107-025-02266-5"},{"issue":"373","key":"3196_CR37","first-page":"1","volume":"25","author":"Y Wu","year":"2024","unstructured":"Wu, Y., Pan, S., Yang, X.: An inexact projected regularized newton method for fused zero-norms regularization problems. J. Mach. Learn. Res. 25(373), 1\u201348 (2024)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"3196_CR38","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., Mor\u00e9, J.J.: Projected gradient methods for linearly constrained problems. Math. Program. 39(1), 93\u2013116 (1987)","journal-title":"Math. Program."},{"issue":"4","key":"3196_CR39","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000). https:\/\/doi.org\/10.1137\/S1052623497330963","journal-title":"SIAM J. Optim."},{"key":"3196_CR40","doi-asserted-by":"publisher","unstructured":"Facchinei, F., J\u00fadice, J., Soares, J.a.: An active set newton algorithm for large-scale nonlinear programs with box constraints. SIAM Journal on Optimization 8(1), 158\u2013186 (1998) https:\/\/doi.org\/10.1137\/S1052623493253991","DOI":"10.1137\/S1052623493253991"},{"issue":"4","key":"3196_CR41","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623499359890","volume":"12","author":"F Facchinei","year":"2002","unstructured":"Facchinei, F., Lucidi, S., Palagi, L.: A truncated newton algorithm for large scale box constrained optimization. SIAM J. Optim. 12(4), 1100\u20131125 (2002). https:\/\/doi.org\/10.1137\/S1052623499359890","journal-title":"SIAM J. Optim."},{"issue":"7","key":"3196_CR42","doi-asserted-by":"publisher","first-page":"3561","DOI":"10.1016\/j.apm.2011.01.036","volume":"35","author":"G Yuan","year":"2011","unstructured":"Yuan, G., Lu, X.: An active set limited memory bfgs algorithm for bound constrained optimization. Appl. Math. Model. 35(7), 3561\u20133573 (2011). https:\/\/doi.org\/10.1016\/j.apm.2011.01.036","journal-title":"Appl. Math. Model."},{"key":"3196_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.rico.2021.100012","volume":"3","author":"S Nakayama","year":"2021","unstructured":"Nakayama, S., Narushima, Y., Nishio, H., Yabe, H.: An active-set memoryless quasi-newton method based on a spectral-scaling broyden family for bound constrained optimization. Results in Control and Optimization 3, 100012 (2021). https:\/\/doi.org\/10.1016\/j.rico.2021.100012","journal-title":"Results in Control and Optimization"},{"key":"3196_CR44","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.acha.2019.08.005","volume":"50","author":"W Cheng","year":"2021","unstructured":"Cheng, W., Dai, Y.-H.: An active set newton-cg method for $$\\ell _1$$ optimization. Applied and Computational Harmonic Analysis 50, 303\u2013325 (2021). https:\/\/doi.org\/10.1016\/j.acha.2019.08.005","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"3","key":"3196_CR45","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":"3196_CR46","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\u2013137 (1995)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"3196_CR47","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s11590-015-0983-3","volume":"11","author":"H Zhang","year":"2017","unstructured":"Zhang, H., Cheng, L.: Projected shrinkage algorithm for box-constrained $$\\ell _1$$-minimization. Optimization Letters 11(1), 55\u201370 (2017)","journal-title":"Optimization Letters"},{"key":"3196_CR48","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.apnum.2023.07.004","volume":"193","author":"W Cheng","year":"2023","unstructured":"Cheng, W., LinPeng, Z., Li, D.: An inexact quasi-newton algorithm for large-scale $$\\ell _1$$ optimization with box constraints. Applied Numerical Mathematics 193, 179\u2013195 (2023). https:\/\/doi.org\/10.1016\/j.apnum.2023.07.004","journal-title":"Applied Numerical Mathematics"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03196-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03196-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03196-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T07:14:26Z","timestamp":1772608466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03196-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,2]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["3196"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03196-w","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,2]]},"assertion":[{"value":"9 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"68"}}