{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T07:06:44Z","timestamp":1751612804601,"version":"3.40.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T00:00:00Z","timestamp":1744070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T00:00:00Z","timestamp":1744070400000},"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":["NSFC-72394365"],"award-info":[{"award-number":["NSFC-72394365"]}],"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":[[2025,5]]},"DOI":"10.1007\/s10915-025-02877-2","type":"journal-article","created":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:52:22Z","timestamp":1744149142000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Nonmonotone Active-Set Semismooth Newton Method for Matrix Approximation with Group Regularization"],"prefix":"10.1007","volume":"103","author":[{"given":"Chungen","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei Hong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhensheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5349-8621","authenticated-orcid":false,"given":"Lei-Hong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,8]]},"reference":[{"key":"2877_CR1","first-page":"6745","volume":"96","author":"U Alon","year":"1999","unstructured":"Alon, U., Barkai, N., Notterman, D.A., Gish, K.: Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Cell Biol. 96, 6745\u20136750 (1999)","journal-title":"Cell Biol."},{"issue":"1","key":"2877_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"2877_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","volume-title":"First-order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-order Methods in Optimization. SIAM, Philadelphia, PA (2017)"},{"issue":"1","key":"2877_CR4","doi-asserted-by":"crossref","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."},{"issue":"1","key":"2877_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1214\/009053607000000758","volume":"36","author":"PJ Bickel","year":"2008","unstructured":"Bickel, P.J., Levina, E.: Regularized estimation of large covariance matrices. Ann. Stat. 36(1), 199\u2013227 (2008)","journal-title":"Ann. Stat."},{"issue":"4","key":"2877_CR6","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1093\/biomet\/asr054","volume":"98","author":"J Bien","year":"2011","unstructured":"Bien, J., Tibshirani, R.J.: Sparse estimation of a covariance matrix. Biometrika 98(4), 807\u2013820 (2011)","journal-title":"Biometrika"},{"key":"2877_CR7","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/0805038","volume":"5","author":"JF Bonnans","year":"1995","unstructured":"Bonnans, J.F., Launay, G.: Sequential quadratic-programming with penalization of the displacement. SIAM J. Optim. 5, 792\u2013812 (1995)","journal-title":"SIAM J. Optim."},{"key":"2877_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer-Verlag, New York (2000)"},{"issue":"1","key":"2877_CR9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1093\/imanum\/drn085","volume":"30","author":"R Borsdorf","year":"2010","unstructured":"Borsdorf, R., Higham, N.J.: A preconditioned Newton algorithm for the nearest correlation matrix. IMA J. Numer. Anal. 30(1), 94\u2013107 (2010)","journal-title":"IMA J. Numer. Anal."},{"key":"2877_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01581073","volume":"57","author":"JM Borwein","year":"1992","unstructured":"Borwein, J.M., Lewis, A.S.: Partially finite convex programming, part II: explicit lattice models. Math. Programming 57, 49\u201383 (1992)","journal-title":"Math. Programming"},{"issue":"1","key":"2877_CR11","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1137\/070681235","volume":"19","author":"Z Chan","year":"2008","unstructured":"Chan, Z., Sun, D.: Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming. SIAM J. Optim. 19(1), 370\u2013396 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2877_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961199","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. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"4","key":"2877_CR13","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1137\/S1052623400380584","volume":"13","author":"X Chen","year":"2003","unstructured":"Chen, X., Qi, H., Tseng, P.: Analysis of nonsmooth symmetric-matrix-valued functions with applications to semidefinite complementarity problems. SIAM J. Optim. 13(4), 960\u2013985 (2003)","journal-title":"SIAM J. Optim."},{"key":"2877_CR14","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, Philadelphia (1990)"},{"key":"2877_CR15","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.csda.2014.10.001","volume":"93","author":"Y Cui","year":"2016","unstructured":"Cui, Y., Leng, C., Sun, D.: Sparse estimation of high-dimensional correlation matrices. Comput. Stat. Data Anal. 93, 390\u2013403 (2016)","journal-title":"Comput. Stat. Data Anal."},{"issue":"4\u20135","key":"2877_CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1080\/02331930310001611547","volume":"52","author":"Y Dai","year":"2003","unstructured":"Dai, Y.: Alternate step gradient method. Optimization 52(4\u20135), 395\u2013415 (2003)","journal-title":"Optimization"},{"issue":"3","key":"2877_CR17","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10107-004-0516-9","volume":"103","author":"Y Dai","year":"2005","unstructured":"Dai, Y., Fletcher, R.: On the asymptotic behaviour of some new gradient methods. Math. Programming 103(3), 541\u2013559 (2005)","journal-title":"Math. Programming"},{"issue":"1","key":"2877_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10589-019-00107-8","volume":"74","author":"Y Dai","year":"2019","unstructured":"Dai, Y., Huang, Y., Liu, X.: A family of spectral gradient methods for optimization. Comput. Optim. Appl. 74(1), 43\u201365 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2877_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Programming 91(2), 201\u2013213 (2002)","journal-title":"Math. Programming"},{"issue":"15","key":"2877_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.laa.2014.07.026","volume":"461","author":"X Duan","year":"2014","unstructured":"Duan, X., Bai, J., Zhang, M., Zhang, X.: On the generalized low rank approximation of the correlation matrices arising in the asset portfolio. Linear Algebra Appl. 461(15), 1\u201317 (2014)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2877_CR21","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/S1052623496305882","volume":"9","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J. Optim. 9(1), 14\u201332 (1998)","journal-title":"SIAM J. Optim."},{"key":"2877_CR22","doi-asserted-by":"crossref","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, Vols I and II. Springer, New York, USA, (2003)","DOI":"10.1007\/b97543"},{"issue":"1","key":"2877_CR23","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."},{"issue":"3","key":"2877_CR24","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1137\/080727075","volume":"31","author":"Y Gao","year":"2009","unstructured":"Gao, Y., Sun, D.: Calibrating least squares semidefinite programming with equality and inequality constraints. SIAM J. Matrix Anal. Appl. 31(3), 1432\u20131457 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2877_CR25","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Approximation par \u00e9l\u00e9ments finis d\u2019ordre un et r\u00e9solution par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes non lin\u00e9aires. RAIRO. Rech. Op\u00e9r 9, 41\u201376 (1975)","journal-title":"RAIRO. Rech. Op\u00e9r"},{"issue":"4","key":"2877_CR26","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1137\/S1064827598345667","volume":"23","author":"NIM Gould","year":"2001","unstructured":"Gould, N.I.M., Hribar, M.E., Nocedal, J.: On the solution of equality constrained quadratic problems arising in optimization. SIAM J. Sci. Comput. 23(4), 1376\u20131395 (2001)","journal-title":"SIAM J. Sci. Comput."},{"key":"2877_CR27","first-page":"2004","volume":"17","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Gunn, S., Hur, A.B., Dror, G.: Result analysis of the nips: feature selection challenge. Adv. Neural. Inf. Process. Syst. 17, 2004 (2003)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"2877_CR28","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the O(1\/n) convergence rate of the Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"2877_CR29","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s00211-014-0673-6","volume":"130","author":"B He","year":"2015","unstructured":"He, B., Yuan, X.: On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers. Numer. Math. 130(3), 567\u2013577 (2015)","journal-title":"Numer. Math."},{"key":"2877_CR30","unstructured":"Krizhevsky, A.: Learning multiple layers of features from tiny images. Master\u2019s thesis, University of Tront, (2009)"},{"key":"2877_CR31","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s12532-010-0020-6","volume":"2","author":"L Li","year":"2010","unstructured":"Li, L., Toh, K.-C.: An inexact interior point method for l1-regularized sparse covariance selection. Math. Program. Comput. 2, 291\u2013315 (2010)","journal-title":"Math. Program. Comput."},{"key":"2877_CR32","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.csda.2018.07.011","volume":"128","author":"P Li","year":"2018","unstructured":"Li, P., Xiao, Y.: An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation. Comput. Stat. Data Anal. 128, 292\u2013307 (2018)","journal-title":"Comput. Stat. Data Anal."},{"issue":"4","key":"2877_CR33","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1137\/090771181","volume":"21","author":"Q Li","year":"2011","unstructured":"Li, Q., Qi, H.: A sequential semismooth Newton method for the nearest low-rank correlation matrix problem. SIAM J. Optim. 21(4), 1641\u20131666 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2877_CR34","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1080\/10618600.2013.782818","volume":"23","author":"H Liu","year":"2014","unstructured":"Liu, H., Wang, L., Zhao, T.: Sparse covariance matrix estimation with eigenvalue constraints. J. Comput. Graph. Stat. 23(2), 439\u2013459 (2014)","journal-title":"J. Comput. Graph. Stat."},{"issue":"4","key":"2877_CR35","first-page":"1","volume":"37","author":"X Liu","year":"2022","unstructured":"Liu, X., Shen, C., Wang, L.: A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices. Optim. Methods Soft. 37(4), 1\u201325 (2022)","journal-title":"Optim. Methods Soft."},{"issue":"4","key":"2877_CR36","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1137\/080742531","volume":"31","author":"Z Lu","year":"2010","unstructured":"Lu, Z.: Adaptive first-order methods for general sparse inverse covariance selection. SIAM J. Matrix Anal. Appl. 31(4), 2000\u20132016 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2877_CR37","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10589-020-00166-2","volume":"76","author":"T Nakagaki","year":"2020","unstructured":"Nakagaki, T., Fukuda, M., Kim, S., Yamashita, M.: A dual spectral projected gradient method for log-determinant semidefinite problems. Comput. Optim. Appl. 76, 33\u201368 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"2877_CR38","doi-asserted-by":"crossref","first-page":"104142","DOI":"10.1016\/j.chemolab.2020.104142","volume":"206","author":"JH Nam","year":"2020","unstructured":"Nam, J.H., Kim, D., Chung, D.J.: Sparse linear discriminant analysis using the prior-knowledge-guided block covariance matrix. Chemom. Intell. Lab. Syst. 206, 104142 (2020)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"2877_CR39","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006)"},{"key":"2877_CR40","doi-asserted-by":"crossref","unstructured":"Perrot-Dock\u00e8s, M., L\u00e9vy-Leduc, C., Rajjou, L.: Estimation of large block structured covariance matrices: application to \u2018multi-omic\u2019approaches to study seed quality. J. R. Stat. Soc.:Series C (Appl. Stat.), 71(1):119\u2013147, (2021)","DOI":"10.1111\/rssc.12524"},{"issue":"2","key":"2877_CR41","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H Qi","year":"2006","unstructured":"Qi, H., Sun, D.: A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28(2), 360\u2013385 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2877_CR42","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, 227\u2013244 (1993)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"2877_CR43","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01582577","volume":"64","author":"L Qi","year":"1994","unstructured":"Qi, L.: Superlinearly convergent approximate Newton methods for $$LC^1$$ optimization problems. Math. Programming 64(1\u20133), 277\u2013294 (1994)","journal-title":"Math. Programming"},{"key":"2877_CR44","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. Programming 58, 353\u2013367 (1993)","journal-title":"Math. Programming"},{"issue":"3","key":"2877_CR45","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13(3), 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"key":"2877_CR46","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BFb0121018","volume":"22","author":"SM Robinson","year":"1984","unstructured":"Robinson, S.M.: Local structure of feasible sets in nonlinear programming, part ii: nondegeneracy. Math. Program. Study 22, 217\u2013230 (1984)","journal-title":"Math. Program. Study"},{"key":"2877_CR47","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"2877_CR48","doi-asserted-by":"crossref","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":"3","key":"2877_CR49","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1093\/biomet\/ass025","volume":"99","author":"A Rothman","year":"2012","unstructured":"Rothman, A.: Positive definite estimators of large covariance matrices. Biometrika 99(3), 733\u2013740 (2012)","journal-title":"Biometrika"},{"key":"2877_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-020-00228-5","volume":"78","author":"C Shen","year":"2021","unstructured":"Shen, C., Wang, Y., Xue, W., Zhang, L.-H.: An accelerated active-set algorithm for a quadratic semidefinite program with general constraints. Comput. Optim. Appl. 78, 1\u201342 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2877_CR51","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/moor.1060.0195","volume":"31","author":"D Sun","year":"2006","unstructured":"Sun, D.: 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":"2877_CR52","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/moor.27.1.150.342","volume":"27","author":"D Sun","year":"2002","unstructured":"Sun, D., Sun, J.: Semi-smooth matrix valued functions. Math. Oper. Res. 27(1), 150\u2013169 (2002)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2877_CR53","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1080\/10556788.2013.829057","volume":"29","author":"B Wang","year":"2014","unstructured":"Wang, B., Zhang, L.: Calibrating low-rank correlation matrix problem: an SCA-based approach. Optim. Methods Soft. 29(3), 561\u2013582 (2014)","journal-title":"Optim. Methods Soft."},{"issue":"2","key":"2877_CR54","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s10589-015-9812-y","volume":"64","author":"C Wang","year":"2016","unstructured":"Wang, C.: On how to solve large-scale log-determinant optimization problems. Comput. Optim. Appl. 64(2), 489\u2013511 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"2877_CR55","doi-asserted-by":"crossref","first-page":"2994","DOI":"10.1137\/090772514","volume":"20","author":"C Wang","year":"2010","unstructured":"Wang, C., Sun, D., Toh, K.-C.: Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm. SIAM J. Optim. 20(6), 2994\u20133013 (2010)","journal-title":"SIAM J. Optim."},{"key":"2877_CR56","unstructured":"Wen, Z., Liu, H., Hu, J.: Nesterov accelerated algorithm for LASSO problem (FISTA algorithm). http:\/\/faculty.bicmr.pku.edu.cn\/wenzw\/optbook\/pages\/lasso_proxg\/LASSO_Nesterov_inn.html, 2024. Accessed: (May 5, 2024)"},{"issue":"3","key":"2877_CR57","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s40305-021-00351-y","volume":"9","author":"Y Xiao","year":"2021","unstructured":"Xiao, Y., Li, P., Lu, S.: Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints. J. Oper. Res. Soc. China 9(3), 543\u2013568 (2021)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"500","key":"2877_CR58","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1080\/01621459.2012.725386","volume":"107","author":"L Xue","year":"2012","unstructured":"Xue, L., Ma, S., Zou, H.: Positive definite $$\\ell _1$$ penalized estimation of large covariance matrices. J. Amer. Statist. Assoc. 107(500), 1480\u20131491 (2012)","journal-title":"J. Amer. Statist. Assoc."},{"issue":"2","key":"2877_CR59","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1137\/120864192","volume":"23","author":"J Yang","year":"2013","unstructured":"Yang, J., Sun, D., Toh, K.-C.: A proximal point algorithm for log-determinant optimization with group lasso regularization. SIAM J. Optim. 23(2), 857\u2013893 (2013)","journal-title":"SIAM J. Optim."},{"key":"2877_CR60","first-page":"1999","volume":"13","author":"G Yuan","year":"2012","unstructured":"Yuan, G., Ho, C.-H., Lin, C.-J.: An improved GLMNET for l1-regularized logistic regression. J. Mach. Learn. Res. 13, 1999\u20132030 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"2877_CR61","doi-asserted-by":"crossref","unstructured":"Zarantonello, E.H.: Projections on convex sets in Hilbert space and spectral theory I and II. In Contributions to nonlinear functional analysis, pages 237\u2013424. Elsevier, New York, (1971)","DOI":"10.1016\/B978-0-12-775850-3.50013-3"},{"key":"2877_CR62","doi-asserted-by":"crossref","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, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2877_CR63","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1137\/19M1267830","volume":"30","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Zhang, N., Sun, D., Toh, K.-C.: A proximal point dual Newton algorithm for solving group graphical lasso problems. SIAM J. Optim. 30(3), 2197\u20132220 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2877_CR64","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou, B., Gao, L., Dai, Y.: Gradient methods with adaptive step-sizes. Comput. Optim. Appl. 35(1), 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"2877_CR65","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1015-3","volume-title":"Weakly Differentiable Functions: Sobolev Spaces and Functions of Bounded Variation","author":"WP Ziemer","year":"1989","unstructured":"Ziemer, W.P.: Weakly Differentiable Functions: Sobolev Spaces and Functions of Bounded Variation. Springer-Verlag, Berlin (1989)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02877-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02877-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02877-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T19:11:09Z","timestamp":1745694669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02877-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,8]]},"references-count":65,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["2877"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02877-2","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,4,8]]},"assertion":[{"value":"5 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","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 have not disclosed any Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"62"}}