{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T02:40:14Z","timestamp":1774924814446,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T00:00:00Z","timestamp":1536710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["FI 370074011"],"award-info":[{"award-number":["FI 370074011"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10107-018-1329-6","type":"journal-article","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T04:09:20Z","timestamp":1536725360000},"page":"223-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems"],"prefix":"10.1007","volume":"179","author":[{"given":"Yangjing","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ning","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0481-272X","authenticated-orcid":false,"given":"Defeng","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,12]]},"reference":[{"key":"1329_CR1","doi-asserted-by":"crossref","unstructured":"Andrew, G., Gao, J.: Scalable training of $$L_1$$ L 1 -regularized log-linear models. In: Proceedings of the 24th International Conference on Machine Learning. ACM, pp. 33\u201340 (2007)","DOI":"10.1145\/1273496.1273501"},{"key":"1329_CR2","unstructured":"Argyriou, A., Micchelli, C.A., Pontil, M., Shen, L., Xu, Y.: Efficient First Order Methods for Linear Composite Regularizers. arXiv preprint arXiv:1104.1436 (2011)"},{"key":"1329_CR3","volume-title":"Convex Analysis and Nonlinear Optimization: Theory and Examples","author":"J Borwein","year":"2010","unstructured":"Borwein, J., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer Science & Business Media, New York (2010)"},{"issue":"1","key":"1329_CR4","doi-asserted-by":"crossref","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)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1\u20132","key":"1329_CR5","doi-asserted-by":"crossref","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 $$\\ell _1$$ \u2113 1 -regularized optimization. Math. Program. 159(1\u20132), 435\u2013467 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"1329_CR6","first-page":"27","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"1\u20132","key":"1329_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D.F., Toh, K.-C.: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161(1\u20132), 237\u2013270 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"1329_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1022996819381","volume":"25","author":"XD Chen","year":"2003","unstructured":"Chen, X.D., Sun, D.F., Sun, J.: Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems. Comput. Optim. Appl. 25(1), 39\u201356 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"1329_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, University City (1990)"},{"key":"1329_CR10","unstructured":"Cui, Y., Sun, D.F., Toh, K.-C.: On the Asymptotic Superlinear Convergence of the Augmented Lagrangian Method for Semidefinite Programming with Multiple Solutions. arXiv preprint arXiv:1610.00875 (2016)"},{"key":"1329_CR11","doi-asserted-by":"crossref","unstructured":"Cui, Y., Sun, D.F., Toh, K.-C.: On the R-superlinear Convergence of the KKT Residues Generated by the Augmented Lagrangian Method for Convex Composite Conic Programming. Mathematical Programming (arXiv preprint arXiv:1706.08800 ) (2018)","DOI":"10.1007\/s10107-018-1300-6"},{"issue":"2","key":"1329_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10589-017-9891-z","volume":"67","author":"JC Reyes De Los","year":"2017","unstructured":"De Los Reyes, J.C., Loayza, E., Merino, P.: Second-order orthant-based methods with enriched Hessian information for sparse $$\\ell _1 $$ \u2113 1 -optimization. Comput. Optim. Appl. 67(2), 225\u2013258 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"9","key":"1329_CR13","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1016\/j.aml.2007.07.037","volume":"22","author":"Y Dong","year":"2009","unstructured":"Dong, Y.: An extension of Luque\u2019s growth condition. Appl. Math. Lett. 22(9), 1390\u20131393 (2009)","journal-title":"Appl. Math. Lett."},{"issue":"11","key":"1329_CR14","doi-asserted-by":"crossref","first-page":"5302","DOI":"10.1109\/TIT.2009.2030471","volume":"55","author":"YC Eldar","year":"2009","unstructured":"Eldar, Y.C., Mishali, M.: Robust recovery of signals from a structured union of subspaces. IEEE Trans. Inf. Theory 55(11), 5302\u20135316 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1329_CR15","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2007","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Science & Business Media, New York (2007)"},{"issue":"3","key":"1329_CR16","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/110853996","volume":"34","author":"M Fazel","year":"2013","unstructured":"Fazel, M., Pong, T.K., Sun, D.F., Tseng, P.: Hankel matrix rank minimization with applications to system identification and realization. SIAM J. Matrix Anal. Appl. 34(3), 946\u2013977 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1329_CR17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman, J., Hastie, T., H\u00f6fling, H., Tibshirani, R.: Pathwise coordinate optimization. Ann. Appl. Stat. 1(2), 302\u2013332 (2007)","journal-title":"Ann. Appl. Stat."},{"key":"1329_CR18","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: A Note on the Group Lasso and a Sparse Group Lasso. arXiv preprint arXiv:1001.0736 (2010)"},{"issue":"1","key":"1329_CR19","doi-asserted-by":"crossref","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":"1329_CR20","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":"1329_CR21","doi-asserted-by":"crossref","unstructured":"Hallac, D., Leskovec, J., Boyd, S.: Network lasso: clustering and optimization in large graphs. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp. 387\u2013396 (2015)","DOI":"10.1145\/2783258.2783313"},{"key":"1329_CR22","unstructured":"Huang, L., Jia, J., Yu, B., Chun, B.-G., Maniatis, P., Naik, M.: Predicting execution time of computer programs using sparse polynomial regression. In: Advances in Neural Information Processing Systems, pp. 883\u2013891 (2010)"},{"key":"1329_CR23","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.-P.: Group lasso with overlap and graph lasso. In: Proceedings of the 26th Annual International Conference on Machine Learning. ACM, pp. 433\u2013440 (2009)","DOI":"10.1145\/1553374.1553431"},{"key":"1329_CR24","unstructured":"Jenatton, R., Mairal, J., Bach, F.R., Obozinski, G.R.: Proximal methods for sparse hierarchical dictionary learning. In: Proceedings of the 27th International Conference on Machine Learning (ICML), pp. 487\u2013494 (2010)"},{"issue":"3","key":"1329_CR25","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1175\/1520-0477(1996)077<0437:TNYRP>2.0.CO;2","volume":"77","author":"E Kalnay","year":"1996","unstructured":"Kalnay, E., Kanamitsu, M., Kistler, R., Collins, W., Deaven, D., Gandin, L., Iredell, M., Saha, S., White, G., Woollen, J., Zhu, Y., Chelliah, M., Ebisuzaki, W., Higgins, W., Janowiak, J., Mo, K.C., Ropelewski, C., Wang, J., Leetmaa, A., Reynolds, R., Jenne, R., Joseph, D.: The NCEP\/NCAR 40-year reanalysis project. Bull. Am. Meteorol. Soc. 77(3), 437\u2013472 (1996)","journal-title":"Bull. Am. Meteorol. Soc."},{"key":"1329_CR26","unstructured":"Kim, J., Park, H.: Fast active-set-type algorithms for $$l_1$$ l 1 -regularized linear regression. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 397\u2013404 (2010)"},{"key":"1329_CR27","doi-asserted-by":"crossref","unstructured":"Kong, D., Ding, C.: Efficient algorithms for selecting features with arbitrary group constraints via group lasso. In: 2013 IEEE 13th International Conference on Data Mining, pp. 379\u2013388 (2013)","DOI":"10.1109\/ICDM.2013.168"},{"key":"1329_CR28","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1515\/9783112479926-011","volume":"45","author":"B Kummer","year":"1988","unstructured":"Kummer, B.: Newton\u2019s method for non-differentiable functions. Adv. Math. Optim. 45, 114\u2013125 (1988)","journal-title":"Adv. Math. Optim."},{"key":"1329_CR29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-642-51682-5_12","volume-title":"Advances in Optimization","author":"B Kummer","year":"1992","unstructured":"Kummer, B.: Newton\u2019s method based on generalized derivatives for nonsmooth functions: convergence analysis. In: Oettli, W., Pallaschke, D. (eds.) Advances in Optimization, pp. 171\u2013194. Springer, New York (1992)"},{"issue":"1","key":"1329_CR30","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., 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":"2","key":"1329_CR31","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/17M1136390","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., 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\u20131862 (2018)","journal-title":"SIAM J. Optim."},{"key":"1329_CR32","unstructured":"Lichman, M.: UCI machine learning repository. School of Information and Computer Sciences, University of California, Irvine (2013)"},{"key":"1329_CR33","first-page":"491","volume":"6","author":"J Liu","year":"2009","unstructured":"Liu, J., Ji, S., Ye, J.: SLEP: sparse learning with efficient projections. Ariz. State Univ. 6, 491 (2009)","journal-title":"Ariz. State Univ."},{"key":"1329_CR34","unstructured":"Liu, J., Ye, J.: Moreau-Yosida regularization for grouped tree structure learning. In: Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J. and Zemel, R.S., Culotta, A. (eds.) Advances in Neural Information Processing Systems 23, pp. 1459\u20131467. Curran Associates, Inc. (2010)"},{"issue":"1","key":"1329_CR35","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1329_CR36","doi-asserted-by":"crossref","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."},{"issue":"2","key":"1329_CR37","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s10107-005-0629-9","volume":"104","author":"F Meng","year":"2005","unstructured":"Meng, F., Sun, D.F., Zhao, G.: Semismoothness of solutions to generalized equations and the Moreau\u2013Yosida regularization. Math. Program. 104(2), 561\u2013581 (2005)","journal-title":"Math. Program."},{"issue":"6","key":"1329_CR38","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15(6), 959\u2013972 (1977)","journal-title":"SIAM J. Control Optim."},{"key":"1329_CR39","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: Gap safe screening rules for sparse-group lasso. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems 29, pp. 388\u2013396. Curran Associates, Inc. (2016)"},{"issue":"1","key":"1329_CR40","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1214\/09-AOAS271","volume":"4","author":"J Peng","year":"2010","unstructured":"Peng, J., Zhu, J., Bergamaschi, A., Han, W., Noh, D.-Y., Pollack, J.R., Wang, P.: Regularized multivariate regression for identifying master predictors with application to integrative genomics study of breast cancer. Ann. Appl. Stat. 4(1), 53 (2010)","journal-title":"Ann. Appl. Stat."},{"issue":"1","key":"1329_CR41","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L Qi","year":"1993","unstructured":"Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18(1), 227\u2013244 (1993)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1329_CR42","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58(1), 353\u2013367 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"1329_CR43","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s12532-013-0051-x","volume":"5","author":"Z Qin","year":"2013","unstructured":"Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient block-coordinate descent algorithms for the group lasso. Math. Program. Comput. 5(2), 143\u2013169 (2013)","journal-title":"Math. Program. Comput."},{"issue":"1\u20132","key":"1329_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1\u20132), 1\u201338 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1329_CR45","doi-asserted-by":"crossref","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":"1329_CR46","doi-asserted-by":"crossref","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":"1329_CR47","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)"},{"issue":"2","key":"1329_CR48","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/10618600.2012.681250","volume":"22","author":"N Simon","year":"2013","unstructured":"Simon, N., Friedman, J., Hastie, T., Tibshirani, R.: A sparse-group lasso. J. Comput. Graph. Stat. 22(2), 231\u2013245 (2013)","journal-title":"J. Comput. Graph. Stat."},{"issue":"4","key":"1329_CR49","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/moor.1060.0195","volume":"31","author":"DF Sun","year":"2006","unstructured":"Sun, D.F.: The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31(4), 761\u2013776 (2006)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1329_CR50","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/moor.27.1.150.342","volume":"27","author":"DF Sun","year":"2002","unstructured":"Sun, D.F., Sun, J.: Semismooth matrix-valued functions. Math. Oper. Res. 27(1), 150\u2013169 (2002)","journal-title":"Math. Oper. Res."},{"key":"1329_CR51","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 (Methodol) 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol)"},{"issue":"1","key":"1329_CR52","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., Knight, K.: Sparsity and smoothness via the fused lasso. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 67(1), 91\u2013108 (2005)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"1329_CR53","unstructured":"Yu, Y.-L.: On decomposing the proximal map. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 26, pp. 91\u201399. Curran Associates, Inc. (2013)"},{"key":"1329_CR54","unstructured":"Yuan, L., Liu, J., Ye, J.: Efficient methods for overlapping group lasso. In: Shawe-Taylor, J., Zemel, R.S., Bartlett, P.L., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 24, pp. 352\u2013360. Curran Associates, Inc. (2011)"},{"issue":"1","key":"1329_CR55","doi-asserted-by":"crossref","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.)"},{"issue":"2","key":"1329_CR56","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s40305-013-0015-x","volume":"1","author":"H Zhang","year":"2013","unstructured":"Zhang, H., Jiang, J., Luo, Z.-Q.: On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems. J. Oper. Res. Soc. China 1(2), 163\u2013186 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"4","key":"1329_CR57","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY 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":"1329_CR58","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1109\/TMM.2017.2689918","volume":"19","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Han, J., Yuan, X., Wei, Z., Hong, R.: Inverse sparse group lasso model for robust object tracking. IEEE Trans. Multimed. 19, 1798\u20131810 (2017)","journal-title":"IEEE Trans. Multimed."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1329-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1329-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1329-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T05:59:38Z","timestamp":1720591178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1329-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,12]]},"references-count":58,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1329"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1329-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,12]]},"assertion":[{"value":"15 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}