{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T00:53:25Z","timestamp":1774745605924,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10915-020-01364-0","type":"journal-article","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T14:04:44Z","timestamp":1605794684000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Active-Set Proximal-Newton Algorithm for $$\\ell _1$$ Regularized Optimization Problems with Box Constraints"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0391-5033","authenticated-orcid":false,"given":"Chungen","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjuan","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei-Hong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baiyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"key":"1364_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory Practice and Software","author":"AM Bagirov","year":"2014","unstructured":"Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: Theory Practice and Software. Springer, Berlin (2014)"},{"issue":"1","key":"1364_CR2","doi-asserted-by":"publisher","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":"1364_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/090756855","volume":"4","author":"S Becker","year":"2011","unstructured":"Becker, S., Bobin, J., Cand\u00e8s, E.J.: NESTA: a fast and accurate first-order method for sparse recovery. SIAM J. Imaging Sci. 4, 1\u201339 (2011)","journal-title":"SIAM J. Imaging Sci."},{"issue":"12","key":"1364_CR4","doi-asserted-by":"publisher","first-page":"2992","DOI":"10.1109\/TIP.2007.909319","volume":"6","author":"J Bioucas-Dias","year":"2007","unstructured":"Bioucas-Dias, J., Figueiredo, M.: A new TwIST: two-step iterative shrinkage\/thresholding algorithms for image restoration. IEEE Trans. Image Process. 6(12), 2992\u20133004 (2007)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"1364_CR5","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"1364_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-015-0965-3","volume":"159","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Oztoprak, F.: A family of second-order methods for convex $$l_1$$-regularized optimization. Math. Program. 159, 435\u2013467 (2016)","journal-title":"Math. Program."},{"key":"1364_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-015-0941-y","volume":"157","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Nocedal, J., Oztoprak, F.: An inexact successive quadratic approximation method for $$\\ell _1$$ regularized optimization. Math. Program. 157, 375\u2013396 (2016)","journal-title":"Math. Program."},{"key":"1364_CR8","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1364_CR9","doi-asserted-by":"publisher","first-page":"27: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. Syst. Technol. 2(3), 27:1\u201327:27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"2","key":"1364_CR10","first-page":"139","volume":"15","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H.: A nonmonotone conjugate gradient algorithm for unconstrained optimization. J. Syst. Sci. Complex. 15(2), 139\u2013145 (2002)","journal-title":"J. Syst. Sci. Complex."},{"key":"1364_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"1364_CR12","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":"4","key":"1364_CR13","first-page":"667","volume":"8","author":"L El Ghaoui","year":"2012","unstructured":"El Ghaoui, L., Viallon, V., Rabbani, T.: Safe feature elimination in sparse supervised learning. J. Pacific Optim. 8(4), 667\u2013698 (2012)","journal-title":"J. Pacific Optim."},{"key":"1364_CR14","unstructured":"Fercoq, O., Gramfort, A., Salmon, J.: Mind the duality gap: safer rules for the lasso. In: ICML, pp. 333\u2013342 (2015)"},{"issue":"4","key":"1364_CR15","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"Figueiredo, M.A.T., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Topics Signal Process. 1(4), 586\u2013597 (2007)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"1364_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-013-0063-6","volume":"6","author":"K Fountoulakis","year":"2014","unstructured":"Fountoulakis, K., Gondzio, J., Zhlobich, P.: Matrix-free interior point method for compressed sensing problems. Math. Program. Comput. 6, 1\u201331 (2014)","journal-title":"Math. Program. Comput."},{"key":"1364_CR17","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"J Friedman","year":"2008","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical lasso. Biostatistics 9, 432\u2013441 (2008)","journal-title":"Biostatistics"},{"issue":"6","key":"1364_CR18","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1137\/0322061","volume":"22","author":"EM Gafni","year":"1984","unstructured":"Gafni, E.M., Bertsekas, D.P.: Two-metric projection methods for constrained optimization. SIAM J. Control Optim. 22(6), 936\u2013964 (1984)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"1364_CR19","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"1364_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60(3), 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"1364_CR21","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation for $$l_1$$-minimization: methodology and convergence. SIAM J. Optim. 19, 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"1364_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis and Minimization Algorithms II","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II, vol. 306. Springer-Verlag, Berlin (1993)"},{"key":"1364_CR23","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/10556788.2016.1138222","volume":"31","author":"N Keskar","year":"2016","unstructured":"Keskar, N., Nocedal, J., Oztoprak, F., Wachter, A.: A second-order method for convex $$l_1$$-regularized optimization with active-set prediction. Optim. Methods Softw. 31, 605\u2013621 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1364_CR24","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.: 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":"3","key":"1364_CR25","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10589-018-00056-8","volume":"72","author":"R Lopes","year":"2019","unstructured":"Lopes, R., Santos, S.A., Silva, P.J.S.: Accelerating block coordinate descent methods with identification strategies. Comput. Optim. Appl. 72(3), 609\u2013640 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1364_CR26","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1137\/S1052623495295250","volume":"8","author":"S Lucidi","year":"1998","unstructured":"Lucidi, S., Rochetich, F., Roma, M.: Curvilinear stabilization techniques for truncated Newton methods in large-scale unconstrained optimization. SIAM J. Optim. 8(4), 916\u2013939 (1998)","journal-title":"SIAM J. Optim."},{"key":"1364_CR27","doi-asserted-by":"crossref","unstructured":"Maros, I., C. M\u00e9sz\u00e1ros C, : A repository of convex quadratic programming problems. Optim. Methods Softw. 11&12, 671\u2013681 (1999)","DOI":"10.1080\/10556789908805768"},{"issue":"1","key":"1364_CR28","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/120892167","volume":"24","author":"A Milzarek","year":"2014","unstructured":"Milzarek, A., Ulbrich, M.: A semismooth Newton method with multidimensional filter globalization for $$\\ell _1$$-optimization. SIAM J. Optim. 24(1), 298\u2013333 (2014)","journal-title":"SIAM J. Optim."},{"key":"1364_CR29","volume-title":"Foundations of Machine Learning","author":"M Mohri","year":"2012","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. The MIT Press, Cambridge (2012)"},{"key":"1364_CR30","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: Gap safe screening rules for sparse multi-task and multi-class models. In: NIPS, pp. 811\u2013819 (2015)"},{"key":"1364_CR31","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: GAP safe screening rules for sparse group lasso. In: NIPS, pp 388\u2013396 (2016)"},{"key":"1364_CR32","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)$$. Soviet Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Dokl."},{"key":"1364_CR33","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"3","key":"1364_CR34","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proxmal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"1364_CR35","volume-title":"Advances in Kernel Methods\u2014Support Vector Learning","author":"JC Platt","year":"1998","unstructured":"Platt, J.C.: Fast training of support vector machines using sequential minimal optimization. In: Sch\u00f6lkopf, Bernhard, Burges, Christopher J.C., Smola, Alexander J. (eds.) Advances in Kernel Methods\u2014Support Vector Learning. MIT Press, Cambridge, MA (1998)"},{"key":"1364_CR36","unstructured":"Prokhorov, D.: IJCNN 2001 neural network competition. Slide presentation in IJCNN1, Ford Research Laboratory (2001)"},{"key":"1364_CR37","doi-asserted-by":"crossref","unstructured":"Richt\u00e1rik, P., Tak\u00e1c\u0300 M., : Efficient Serial and Parallel Coordinate Descent Methods For Huge-Scale Truss Topology Design. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-29210-1_5"},{"key":"1364_CR38","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 Stat. Methodol. 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"1364_CR39","unstructured":"UCI Machine Learning Repository, http:\/\/archive.ics.uci.edu\/ml\/machine-learningdatabases\/statlog\/german\/"},{"key":"1364_CR40","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1186\/1471-2105-7-173","volume":"7","author":"AV Uzilov","year":"2006","unstructured":"Uzilov, A.V., Keegan, J.M., Mathews, D.H.: Detection of non-coding RNAs on the basis of predicted secondary structure formation free energy change. BMC Bioinformatics 7, 173 (2006)","journal-title":"BMC Bioinformatics"},{"key":"1364_CR41","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E van den Berg","year":"2008","unstructured":"van den Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1364_CR42","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation. SIAM J. Sci Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci Comput."},{"issue":"7","key":"1364_CR43","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1364_CR44","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018)","journal-title":"J. Sci. Comput."},{"key":"1364_CR45","unstructured":"Yan, Y.M.: Maros and M\u00e9sz\u00e1ros Convex QP test problems in MAT format, https:\/\/github.com\/YimingYAN\/QP-Test-Problems"},{"issue":"1","key":"1364_CR46","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"1364_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 $$l_1$$-minimization. Optim. Lett. 11, 55\u201370 (2017)","journal-title":"Optim. Lett."},{"issue":"4","key":"1364_CR48","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01364-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-020-01364-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01364-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T18:22:50Z","timestamp":1723918970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-020-01364-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,19]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1364"],"URL":"https:\/\/doi.org\/10.1007\/s10915-020-01364-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,19]]},"assertion":[{"value":"28 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"57"}}