{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T16:49:00Z","timestamp":1782578940625,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T00:00:00Z","timestamp":1779148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T00:00:00Z","timestamp":1779148800000},"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":["12271097"],"award-info":[{"award-number":["12271097"]}],"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":["12371301"],"award-info":[{"award-number":["12371301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Program of National Science Foundation of Fujian Province of China","award":["2023J02007"],"award-info":[{"award-number":["2023J02007"]}]},{"DOI":"10.13039\/501100018541","name":"Science Fund for Distinguished Young Scholars of Jiangsu Province","doi-asserted-by":"publisher","award":["22JR5RA223"],"award-info":[{"award-number":["22JR5RA223"]}],"id":[{"id":"10.13039\/501100018541","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,7]]},"DOI":"10.1007\/s10915-026-03316-6","type":"journal-article","created":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T09:48:04Z","timestamp":1779184084000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Sieving with Semismooth Newton Proximal Augmented Lagrangian Algorithm for Multi-Task Lasso Problems"],"prefix":"10.1007","volume":"108","author":[{"given":"Lanyu","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6586-2862","authenticated-orcid":false,"given":"Yong-Jin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junfeng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,19]]},"reference":[{"issue":"3","key":"3316_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., Pontil, M.: Convex multi-task feature learning. Mach. Learn. 73(3), 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"issue":"1","key":"3316_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007379606734","volume":"28","author":"R Caruana","year":"1997","unstructured":"Caruana, R.: Multitask learning. Mach. Learn. 28(1), 41\u201375 (1997)","journal-title":"Mach. Learn."},{"key":"3316_CR3","doi-asserted-by":"crossref","unstructured":"Chen, J.H., Zhou, J.Y., Ye, J.P.: Integrating low-rank and group-sparse structures for robust multi-task learning. In the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 42\u201350 (2011)","DOI":"10.1145\/2020408.2020423"},{"key":"3316_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Pan, W., Kwok, J.T., Carbonell, J.G.: Accelerated gradient method for multi-task sparse learning problem. In the 19th IEEE International Conference on Data Mining. 746\u2013751 (2009)","DOI":"10.1109\/ICDM.2009.128"},{"key":"3316_CR5","unstructured":"Chu, D.J., Zhang, C.S., Sun, S.L., Tao, T.: Semismooth Newton algorithm for efficient projections onto $$\\ell _{1,\\infty }$$-norm ball. In the 37th Annual International Conference on Machine Learning. 1974\u20131983 (2020)"},{"key":"3316_CR6","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"3316_CR7","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis","year":"1983","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, New Jersey (1983)"},{"issue":"18","key":"3316_CR8","first-page":"2899","volume":"10","author":"J Duchi","year":"2009","unstructured":"Duchi, J., Singer, Y.: Efficient online and batch learning using forward backward splitting. J. Mach. Learn. Res. 10(18), 2899\u20132934 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"3316_CR9","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 $$\\text{ SC}^{1}$$ functions and the Maratos effect. Oper. Res. Lett. 17(3), 131\u2013137 (1995)","journal-title":"Oper. Res. Lett."},{"key":"3316_CR10","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)"},{"issue":"6","key":"3316_CR11","doi-asserted-by":"publisher","first-page":"A4147","DOI":"10.1137\/20M1364643","volume":"43","author":"S Fang","year":"2021","unstructured":"Fang, S., Liu, Y.-J., Xiong, X.Z.: Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector. SIAM J. Sci. Comput. 43(6), A4147\u2013A4171 (2021)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"3316_CR12","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":"3316_CR13","unstructured":"Ghaoui, L.E., Viallon, V., Rabbani, T.: Safe feature elimination in sparse supervised learning. Technical report, University of California, Berkeley (2010)"},{"key":"3316_CR14","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","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. ESAIM Math. Model. Numer. Anal. 9, 41\u201376 (1975)","journal-title":"ESAIM Math. Model. Numer. Anal."},{"issue":"3","key":"3316_CR15","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1023\/A:1022653001160","volume":"94","author":"JY Han","year":"1997","unstructured":"Han, J.Y., Sun, D.F.: Newton and quasi-Newton methods for normal maps with polyhedral sets. J. Optim. Theory Appl. 94(3), 659\u2013676 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"3316_CR16","volume-title":"Nonsmooth Equations in Optimization: Regularity, Calculus","author":"D Klatte","year":"2002","unstructured":"Klatte, D., Kummer, B.: Nonsmooth Equations in Optimization: Regularity, Calculus. Methods and Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"134","key":"3316_CR17","first-page":"1","volume":"24","author":"Q Li","year":"2023","unstructured":"Li, Q., Jiang, B.Y., Sun, D.F.: MARS: A second-order reduction algorithm for high-dimensional sparse precision matrices estimation. J. Mach. Learn. Res. 24(134), 1\u201344 (2023)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"3316_CR18","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/17M1136390","volume":"28","author":"XD Li","year":"2017","unstructured":"Li, X.D., Sun, D.F., Toh, K.-C.: On efficiently solving the subproblems of a level-set method for fused Lasso problems. SIAM J. Optim. 28(2), 1842\u20131866 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3316_CR19","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"XD Li","year":"2018","unstructured":"Li, X.D., Sun, D.F., Toh, K.-C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3316_CR20","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-018-1342-9","volume":"179","author":"XD Li","year":"2020","unstructured":"Li, X.D., Sun, D.F., Toh, K.-C.: On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope. Math. Program. 179(1), 419\u2013446 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"3316_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595923500276","volume":"41","author":"LY Lin","year":"2024","unstructured":"Lin, L.Y., Liu, Y.-J.: An inexact semismooth Newton-based augmented Lagrangian algorithm for multi-task Lasso problems. Asia-Pac. J. Oper. Res. 41(3), 1\u201326 (2024)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"3","key":"3316_CR22","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1137\/18M1207752","volume":"29","author":"MX Lin","year":"2019","unstructured":"Lin, M.X., Liu, Y.-J., Sun, D.F., Toh, K.-C.: Efficient sparse semismooth Newton methods for the clustered Lasso problem. SIAM J. Optim. 29(3), 2026\u20132052 (2019)","journal-title":"SIAM J. Optim."},{"key":"3316_CR23","unstructured":"Lin, M.X., Yuan, Y.C., Sun, D.F., Toh, K.-C.: Adaptive sieving with PPDNA: generating solution paths of exclusive Lasso models. arXiv:2009.08719. (2020)"},{"key":"3316_CR24","doi-asserted-by":"crossref","unstructured":"Liu, H., Palatucci, M., Zhang, J.: Blockwise coordinate descent procedures for the multi-task Lasso, with applications to neural semantic basis discovery. In the 26th Annual International Conference on Machine Learning. 649\u2013656 (2009)","DOI":"10.1145\/1553374.1553458"},{"key":"3316_CR25","unstructured":"Liu, Y.-J., Zhou, W.M.: Dual Newton proximal point algorithm for solution paths of the $$\\ell _1$$-Regularized logistic regression. arxiv:2310.19353. (2023)"},{"issue":"2","key":"3316_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0322019","volume":"22","author":"FJ Luque","year":"1984","unstructured":"Luque, F.J.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control. Optim. 22(2), 277\u2013293 (1984)","journal-title":"SIAM J. Control. Optim."},{"key":"3316_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. France 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. France"},{"key":"3316_CR28","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$\\cal{O} (1\/k^2)$$. Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"3316_CR29","volume-title":"Multi-task feature selection","author":"G Obozinski","year":"2006","unstructured":"Obozinski, G., Taskar, B., Jordan, M.: Multi-task feature selection. Technical report, UC Berkeley (2006)"},{"key":"3316_CR30","doi-asserted-by":"crossref","unstructured":"Obozinski, G., Wainwright, M.J., Jordan, M.I.: High-dimensional support union recovery in multivariate regression. Adv. Neural Inform. Process. Syst. 1217\u20131224 (2008)","DOI":"10.21236\/ADA487461"},{"issue":"2","key":"3316_CR31","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/10618600.2000.10474883","volume":"93","author":"MR Osborne","year":"2000","unstructured":"Osborne, M.R., Presnell, B., Turlach, B.A.: On the Lasso and its dual. J. Comput. Graph. Statist. 93(2), 319\u2013337 (2000)","journal-title":"J. Comput. Graph. Statist."},{"key":"3316_CR32","first-page":"1867","volume":"23","author":"S Parameswaran","year":"2010","unstructured":"Parameswaran, S., Weinberger, K.Q.: Large margin multi-task metric learning. Adv. Neural Inform. Process. Syst. 23, 1867\u20131875 (2010)","journal-title":"Adv. Neural Inform. Process. Syst."},{"key":"3316_CR33","unstructured":"Quadrianto, N., Smola, A., Caetano, T., Vishwanathan, S., Petterson, J.: Multitask learning without label correspondences. Adv. Neural Inform. Process. Syst. 23, (2010)"},{"key":"3316_CR34","doi-asserted-by":"crossref","unstructured":"Quattoni, A., Carreras, X., Collins, M., Darrell, T.: An efficient projection for $$\\ell _{1,\\infty }$$ regularization. In the 26th Annual International Conference on Machine Learning. 857\u2013864 (2009)","DOI":"10.1145\/1553374.1553484"},{"key":"3316_CR35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970524","volume-title":"Conjugate Duality and Optimization","author":"RT Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974)"},{"issue":"2","key":"3316_CR36","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"3316_CR37","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(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control. Optim."},{"key":"3316_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"2","key":"3316_CR39","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1111\/j.1467-9868.2011.01004.x","volume":"74","author":"R Tibshirani","year":"2012","unstructured":"Tibshirani, R., Bien, J., Friedman, J., Hastie, T., Simon, N., Taylor, J., Tibshirani, R.J.: Strong rules for discarding predictors in Lasso-type problems. J. R. Stat. Soc. Ser. B-Stat. Methodol. 74(2), 245\u2013266 (2012)","journal-title":"J. R. Stat. Soc. Ser. B-Stat. Methodol."},{"issue":"3","key":"3316_CR40","first-page":"589","volume":"86","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A., Gilbert, A.C., Strauss, M.J.: Algorithms for simultaneous sparse approximation. Part II: Convex relaxation. Signal Process. 86(3), 589\u2013602 (2006)","journal-title":"Part II: Convex relaxation. Signal Process."},{"key":"3316_CR41","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1198\/004017005000000139","volume":"27","author":"BA Turlach","year":"2005","unstructured":"Turlach, B.A., Venables, W.N., Wright, S.J.: Simultaneous variable selection. Technometrics 27, 349\u2013363 (2005)","journal-title":"Technometrics"},{"key":"3316_CR42","first-page":"1","volume":"26","author":"J Wang","year":"2013","unstructured":"Wang, J., Zhou, J.Y., Wonka, P., Ye, J.P.: Lasso screening rules via dual polytope projection. Adv. Neural Inform. Process. Syst. 26, 1\u20139 (2013)","journal-title":"Adv. Neural Inform. Process. Syst."},{"key":"3316_CR43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"3316_CR44","doi-asserted-by":"publisher","unstructured":"Wu, C., Li, D.H., Sun, D.F.: Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing. Math. Program. Comput. https:\/\/doi.org\/10.1007\/s12532-026-00306-5. (2026)","DOI":"10.1007\/s12532-026-00306-5"},{"key":"3316_CR45","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s12532-025-00282-2","volume":"17","author":"YC Yuan","year":"2025","unstructured":"Yuan, Y.C., Lin, M.X., Sun, D.F., Toh, K.-C.: Adaptive sieving: a dimension reduction technique for sparse optimization problems. Math. Program. Comput. 17, 585\u2013616 (2025)","journal-title":"Math. Program. Comput."},{"key":"3316_CR46","unstructured":"Zhang, J.: A probabilistic framework for multi-task learning. Ph.D. dissertation, Carnegie Mellon University (2006)"},{"issue":"4","key":"3316_CR47","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D.F., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"key":"3316_CR48","doi-asserted-by":"crossref","unstructured":"Zhou, J.Y., Yuan, L., Liu, J., Ye, J.P.: A multi-task learning formulation for predicting disease progression. In the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 814\u2013822 (2011)","DOI":"10.1145\/2020408.2020549"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03316-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03316-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03316-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T16:31:24Z","timestamp":1782577884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03316-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,19]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["3316"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03316-6","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,19]]},"assertion":[{"value":"8 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2026","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":"7"}}