{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:40:49Z","timestamp":1740123649731,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T00:00:00Z","timestamp":1730678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T00:00:00Z","timestamp":1730678400000},"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":["11971177","12371299"],"award-info":[{"award-number":["11971177","12371299"]}],"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":[[2024,12]]},"DOI":"10.1007\/s10915-024-02712-0","type":"journal-article","created":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T05:35:29Z","timestamp":1730698529000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A VMiPG Method for Composite Optimization with Nonsmooth Term Having No Closed-form Proximal Mapping"],"prefix":"10.1007","volume":"101","author":[{"given":"Taiwei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaohua","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruyu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,4]]},"reference":[{"issue":"1","key":"2712_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10107-012-0571-6","volume":"134","author":"A Aravkin","year":"2012","unstructured":"Aravkin, A., Friedlander, M.P., Herrmann, F.J., van Leeuwen, T.: Robust inversion, dimensionality reduction, and randomized sampling. Math. Program. 134(1), 101\u2013125 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0571-6","journal-title":"Math. Program."},{"key":"2712_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for non-smooth functions involving analytic features. Math. Program. 116, 5\u201316 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0133-5","journal-title":"Math. Program."},{"issue":"2","key":"2712_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010). https:\/\/doi.org\/10.1287\/moor.1100.0449","journal-title":"Math. Oper. Res."},{"key":"2712_CR4","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, 91\u2013129 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0484-9","journal-title":"Math. Program."},{"issue":"1","key":"2712_CR5","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). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"2712_CR6","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1137\/18M1167152","volume":"29","author":"S Becker","year":"2019","unstructured":"Becker, S., Fadili, J., Ochs, P.: On quasi-Newton forward-backward splitting: proximal calculus and convergence. SIAM J. Optim. 29(4), 2445\u20132481 (2019). https:\/\/doi.org\/10.1137\/18M1167152","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2712_CR7","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1111\/biom.13075","volume":"75","author":"JC Beer","year":"2019","unstructured":"Beer, J.C., Aizenstein, H.J., Anderson, S.J., Krafty, R.T.: Incorporating prior information with fused sparse group lasso: Application to prediction of clinical measures from neuroimages. Biometrics 75(4), 1299\u20131309 (2019). https:\/\/doi.org\/10.1111\/biom.13075","journal-title":"Biometrics"},{"key":"2712_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/2053-2563\/aae109","volume-title":"Inverse imaging with Poisson data: from cells to galaxies","author":"M Bertero","year":"2018","unstructured":"Bertero, M., Boccacci, P., Ruggiero, V.: Inverse imaging with Poisson data: from cells to galaxies. IOP Publishing (2018)"},{"issue":"1\u20132","key":"2712_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0166-9","volume":"117","author":"J Bolte","year":"2009","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: Tame functions are semismooth. Math. Program. 117(1\u20132), 5\u201319 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0166-9","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2712_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and non-smooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0701-9","journal-title":"Math. Program."},{"issue":"2","key":"2712_CR11","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for non-smooth optimization. SIAM J. Optim. 26(2), 891\u2013921 (2016). https:\/\/doi.org\/10.1137\/15M1019325","journal-title":"SIAM J. Optim."},{"issue":"5","key":"2712_CR12","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aa5bfd","volume":"33","author":"S Bonettini","year":"2017","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M., Rebegoldi, S.: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization. Inverse Probl. 33(5), 055005 (2017). https:\/\/doi.org\/10.1088\/1361-6420\/aa5bfd","journal-title":"Inverse Probl."},{"issue":"2","key":"2712_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10589-022-00441-4","volume":"84","author":"S Bonettini","year":"2023","unstructured":"Bonettini, S., Ochs, P., Prato, M., Rebegoldi, S.: An abstract convergence framework with application to inertial inexact forward\u2013backward methods. Comput. Optim. Appl. 84(2), 319\u2013362 (2023). https:\/\/doi.org\/10.1007\/s10589-022-00441-4","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2712_CR14","doi-asserted-by":"publisher","first-page":"3069","DOI":"10.1137\/19M1254155","volume":"30","author":"S Bonettini","year":"2020","unstructured":"Bonettini, S., Prato, M., Rebegoldi, S.: Convergence of inexact forward-backward algorithms using the forward\u2013backward envelope. SIAM J. Optim. 30(4), 3069\u20133097 (2020). https:\/\/doi.org\/10.1137\/19M1254155","journal-title":"SIAM J. Optim."},{"key":"2712_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125719","volume":"392","author":"S Bonettini","year":"2021","unstructured":"Bonettini, S., Prato, M., Rebegoldi, S.: New convergence results for the inexact variable metric forward\u2013backward method. Appl. Math. Comput. 392, 125719 (2021). https:\/\/doi.org\/10.1016\/j.amc.2020.125719","journal-title":"Appl. Math. Comput."},{"issue":"5","key":"2712_CR16","doi-asserted-by":"publisher","first-page":"A3180","DOI":"10.1137\/17M116001X","volume":"40","author":"S Bonettini","year":"2018","unstructured":"Bonettini, S., Rebegoldi, S., Ruggiero, V.: Inertial variable metric techniques for the inexact forward\u2013backward algorithm. SIAM J. Sci. Comput. 40(5), A3180\u2013A3210 (2018). https:\/\/doi.org\/10.1137\/17M116001X","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2712_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018). https:\/\/doi.org\/10.1137\/16M1080173","journal-title":"SIAM Rev."},{"issue":"2","key":"2712_CR18","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. Progr. 157(2), 375\u2013396 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0941-y","journal-title":"Math. Progr."},{"key":"2712_CR19","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the fast iterative shrinkage\/thresholding algorithm. J. Optim. Theory Appl. 166, 968\u2013982 (2015). https:\/\/doi.org\/10.1007\/s10957-015-0746-4","journal-title":"J. Optim. Theory Appl."},{"key":"2712_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer. 25, 161\u2013319 (2016). https:\/\/doi.org\/10.1017\/S096249291600009X","journal-title":"Acta Numer."},{"issue":"2","key":"2712_CR21","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/S105262349529017","volume":"7","author":"GH Chen","year":"1997","unstructured":"Chen, G.H., Rockafellar, R.T.: Convergence rates in forward-backward splitting. SIAM J. Optim. 7(2), 421\u2013444 (1997). https:\/\/doi.org\/10.1137\/S105262349529017","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2712_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-013-0465-7","volume":"162","author":"E Chouzenoux","year":"2014","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function. J. Optim. Theory Appl. 162(1), 107\u2013132 (2014). https:\/\/doi.org\/10.1007\/s10957-013-0465-7","journal-title":"J. Optim. Theory Appl."},{"key":"2712_CR23","unstructured":"Clarke, F.H.: Optimization and non-smooth analysis. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1990)"},{"issue":"9","key":"2712_CR24","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1080\/02331934.2012.733883","volume":"63","author":"PL Combettes","year":"2014","unstructured":"Combettes, P.L., V\u0169, B.C.: Variable metric forward\u2013backward splitting with applications to monotone inclusions in duality. Optimization 63(9), 1289\u20131318 (2014). https:\/\/doi.org\/10.1080\/02331934.2012.733883","journal-title":"Optimization"},{"issue":"11","key":"2712_CR25","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/LSP.2013.2278339","volume":"20","author":"L Condat","year":"2013","unstructured":"Condat, L.: A direct algorithm for 1-d total variation denoising. IEEE Signal Process. Lett. 20(11), 1054\u20131057 (2013). https:\/\/doi.org\/10.1109\/LSP.2013.2278339","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"2712_CR26","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1215\/S0012-7094-96-08416-1","volume":"84","author":"L Van den Dries","year":"1996","unstructured":"Van den Dries, L., Miller, C.: Geometric categories and o-minimal structures. Duke Math. J. 84(2), 497\u2013540 (1996). https:\/\/doi.org\/10.1215\/S0012-7094-96-08416-1","journal-title":"Duke Math. J."},{"key":"2712_CR27","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka-\u0141ojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165, 874\u2013900 (2015). https:\/\/doi.org\/10.1007\/s10957-014-0642-3","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2712_CR28","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/00401706.2017.1345703","volume":"60","author":"Y Gu","year":"2018","unstructured":"Gu, Y., Fan, J., Kong, L., Ma, S., Zou, H.: Admm for high-dimensional sparse penalized quantile regression. Technometrics 60(3), 319\u2013331 (2018). https:\/\/doi.org\/10.1080\/00401706.2017.1345703","journal-title":"Technometrics"},{"issue":"143","key":"2712_CR29","first-page":"8","volume":"143","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical learning with sparsity. Monogr. Stat. Appl. Probab. 143(143), 8 (2015)","journal-title":"Monogr. Stat. Appl. Probab."},{"issue":"4","key":"2712_CR30","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1137\/080722059","volume":"19","author":"AD Ioffe","year":"2008","unstructured":"Ioffe, A.D.: An invitation to tame optimization. SIAM J. Optim. 19(4), 1894\u20131917 (2008). https:\/\/doi.org\/10.1137\/080722059","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2712_CR31","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10589-020-00243-6","volume":"78","author":"C Kanzow","year":"2021","unstructured":"Kanzow, C., Lechner, T.: Globalized inexact proximal Newton-type methods for nonconvex composite functions. Comput. Optim. Appl. 78(2), 377\u2013410 (2021). https:\/\/doi.org\/10.1007\/s10589-020-00243-6","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"2712_CR32","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1088\/0266-5611\/18\/5\/313","volume":"18","author":"H Lanteri","year":"2002","unstructured":"Lanteri, H., Roche, M., Aime, C.: Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms. Inverse Probl. 18(5), 1397 (2002)","journal-title":"Inverse Probl."},{"issue":"3","key":"2712_CR33","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10589-019-00059-z","volume":"72","author":"C Lee","year":"2019","unstructured":"Lee, C., Wright, S.J.: Inexact successive quadratic approximation for regularized optimization. Comput. Optim. Appl. 72(3), 641\u2013674 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00059-z","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"2712_CR34","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka-\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18(5), 1199\u20131232 (2018). https:\/\/doi.org\/10.1007\/s10208-017-9366-8","journal-title":"Found. Comput. Math."},{"issue":"1","key":"2712_CR35","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.C.: A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018). https:\/\/doi.org\/10.1137\/16M1097572","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2712_CR36","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/17M1136390","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.C.: On efficiently solving the subproblems of a level-set method for fused lasso problems. SIAM J. Optim. 28(2), 1842\u20131866 (2018). https:\/\/doi.org\/10.1137\/17M1136390","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2712_CR37","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1137\/18M1207752","volume":"29","author":"M Lin","year":"2019","unstructured":"Lin, M., Liu, Y.J., Sun, D., Toh, K.C.: Efficient sparse semismooth Newton methods for the clustered lasso problem. SIAM J. Optim. 29(3), 2026\u20132052 (2019). https:\/\/doi.org\/10.1137\/18M1207752","journal-title":"SIAM J. Optim."},{"key":"2712_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00560-0","author":"R Liu","year":"2024","unstructured":"Liu, R., Pan, S., Wu, Y., Yang, X.: An inexact regularized proximal Newton method for nonconvex and non-smooth optimization. Comput. Optim. Appl. (2024). https:\/\/doi.org\/10.1007\/s10589-024-00560-0","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2712_CR39","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s10107-022-01797-5","volume":"198","author":"BS Mordukhovich","year":"2023","unstructured":"Mordukhovich, B.S., Yuan, X., Zeng, S., Zhang, J.: A globally convergent proximal Newton-type method in non-smooth convex optimization. Math. Progr. 198(1), 899\u2013936 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01797-5","journal-title":"Math. Progr."},{"issue":"5","key":"2712_CR40","doi-asserted-by":"publisher","first-page":"2886","DOI":"10.1109\/TIT.2015.2401574","volume":"61","author":"S Oymak","year":"2015","unstructured":"Oymak, S., Jalali, A., Fazel, M., Eldar, Y.C., Hassibi, B.: Simultaneously structured models with application to sparse and low-rank matrices. IEEE Trans. Inf. Theory 61(5), 2886\u20132908 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2401574","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2712_CR41","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s10915-015-9991-9","volume":"65","author":"F Porta","year":"2015","unstructured":"Porta, F., Prato, M., Zanni, L.: A new steplength selection for scaled gradient methods with application to image deblurring. J. Sci. Comput. 65(3), 895\u2013919 (2015). https:\/\/doi.org\/10.1007\/s10915-015-9991-9","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2712_CR42","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"LQ Qi","year":"1993","unstructured":"Qi, L.Q., Sun, J.: A non-smooth version of Newton\u2019s method. Math. Progr. 58(3), 353\u2013367 (1993). https:\/\/doi.org\/10.1007\/BF01581275","journal-title":"Math. Progr."},{"key":"2712_CR43","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton Mathematical Series, No. 28. Princeton University Press, Princeton (1970)"},{"key":"2712_CR44","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-Verlag, Berlin, Heidelberg (1998)"},{"issue":"1\u20134","key":"2712_CR45","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60(1\u20134), 259\u2013268 (1992). https:\/\/doi.org\/10.1016\/0167-2789(92)90242-F","journal-title":"Phys. D"},{"issue":"4","key":"2712_CR46","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward-backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27(4), 2153\u20132181 (2017). https:\/\/doi.org\/10.1137\/16M1073741","journal-title":"SIAM J. Optim."},{"key":"2712_CR47","unstructured":"Schmidt, M., Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. Adv. Neural Inf. Process. Syst. 24 (2011)"},{"issue":"3","key":"2712_CR48","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward-backward quasi-Newton methods for non-smooth optimization problems. Comput. Optim. Appl. 67(3), 443\u2013487 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9912-y","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2712_CR49","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward\u2013backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018). https:\/\/doi.org\/10.1137\/16M1080240","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2712_CR50","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00490.x","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"issue":"12","key":"2712_CR51","first-page":"371","volume":"16","author":"Q Tran-Dinh","year":"2015","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: Composite self-concordant minimization. J. Mach. Learn. Res. 16(12), 371\u2013416 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2712_CR52","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1287\/moor.2021.1138","volume":"47","author":"Q Tran-Dinh","year":"2022","unstructured":"Tran-Dinh, Q., Liang, L., Toh, K.C.: A new homotopy proximal variable-metric framework for composite convex minimization. Math. Oper. Res. 47(1), 508\u2013539 (2022). https:\/\/doi.org\/10.1287\/moor.2021.1138","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2712_CR53","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/11084480","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013). https:\/\/doi.org\/10.1137\/11084480","journal-title":"SIAM J. Optim."},{"key":"2712_CR54","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2019.00623","volume":"10","author":"N Wu","year":"2019","unstructured":"Wu, N., Huang, J., Zhang, X.F., Ou-Yang, L., He, S., Zhu, Z.: Weighted fused pathway graphical lasso for joint estimation of multiple gene networks. Front. Genet. 10, 457675 (2019). https:\/\/doi.org\/10.3389\/fgene.2019.00623","journal-title":"Front. Genet."},{"key":"2712_CR55","doi-asserted-by":"publisher","unstructured":"Yu, P., Li, G., Pong, T.K.: Kurdyka\u2013\u0141ojasiewicz exponent via inf-projection. Found. Comput. Math. pp. 1\u201347 (2021). https:\/\/doi.org\/10.1007\/s10208-021-09528-6","DOI":"10.1007\/s10208-021-09528-6"},{"issue":"1","key":"2712_CR56","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10107-018-1280-6","volume":"174","author":"MC Yue","year":"2019","unstructured":"Yue, M.C., Zhou, Z., So, A.M.C.: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property. Math. Progr. 174(1), 327\u2013358 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1280-6","journal-title":"Math. Progr."},{"issue":"2","key":"2712_CR57","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10589-023-00496-xs","volume":"86","author":"D Zhang","year":"2023","unstructured":"Zhang, D., Pan, S., Bi, S., Sun, D.: Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound. Comput. Optim. Appl. 86(2), 627\u2013667 (2023). https:\/\/doi.org\/10.1007\/s10589-023-00496-xs","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2712_CR58","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1007\/s10589-023-00496-x","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D., Toh, K.C.: A Newton-CG augmented lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010). https:\/\/doi.org\/10.1007\/s10589-023-00496-x","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02712-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02712-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02712-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T10:09:34Z","timestamp":1732874974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02712-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,4]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2712"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02712-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2024,11,4]]},"assertion":[{"value":"25 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2024","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":"69"}}