{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:59:32Z","timestamp":1770681572973,"version":"3.49.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T00:00:00Z","timestamp":1712966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T00:00:00Z","timestamp":1712966400000},"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":["72071202"],"award-info":[{"award-number":["72071202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Top Six Talents\u2019 Project of Jiangsu Province","award":["XNYQC-001"],"award-info":[{"award-number":["XNYQC-001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s11075-024-01821-z","type":"journal-article","created":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T11:01:59Z","timestamp":1713006119000},"page":"943-985","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A class of accelerated GADMM-based method for multi-block nonconvex optimization problems"],"prefix":"10.1007","volume":"98","author":[{"given":"Kunyu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoquan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"1821_CR1","doi-asserted-by":"publisher","unstructured":"Huang, F., Chen, S., Lu, Z.: Stochastic alternating direction method of multipliers with variance reduction for nonconvex optimization. (2017) https:\/\/doi.org\/10.48550\/arXiv.1610.02758","DOI":"10.48550\/arXiv.1610.02758"},{"issue":"4","key":"1821_CR2","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 T. Inform. Theor. 52(4), 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"Compressed sensing. IEEE T. Inform. Theor."},{"key":"1821_CR3","doi-asserted-by":"publisher","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3) (2011). https:\/\/doi.org\/10.1145\/1970392.1970395","DOI":"10.1145\/1970392.1970395"},{"key":"1821_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s10957-020-01697-8","volume":"186","author":"J Jian","year":"2020","unstructured":"Jian, J., Zhang, C., Yin, J., Yang, L., Ma, G.: Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems. J. Optim. Theory Appl. 186, 226\u2013247 (2020). https:\/\/doi.org\/10.1007\/s10957-020-01697-8","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1821_CR5","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1109\/TII.2019.2937513","volume":"16","author":"L Yang","year":"2020","unstructured":"Yang, L., Luo, J., Xu, Y., Zhang, Z., Dong, Z.: A distributed dual consensus ADMM based on partition for DC-DOPF with carbon emission trading. IEEE T. Ind. Inform. 16(3), 1858\u20131872 (2020). https:\/\/doi.org\/10.1109\/TII.2019.2937513","journal-title":"IEEE T. Ind. Inform."},{"issue":"8","key":"1821_CR6","doi-asserted-by":"publisher","first-page":"5231","DOI":"10.1109\/TII.2021.3125964","volume":"18","author":"L Yang","year":"2022","unstructured":"Yang, L., Yang, Y., Chen, G., Dong, Z.: Distributionally robust framework and its approximations based on vector and region split for self-scheduling of generation companies. IEEE T. Ind. Inform. 18(8), 5231\u20135241 (2022). https:\/\/doi.org\/10.1109\/TII.2021.3125964","journal-title":"IEEE T. Ind. Inform."},{"key":"1821_CR7","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"},{"issue":"1","key":"1821_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976). https:\/\/doi.org\/10.1016\/0898-1221(76)90003-1","journal-title":"Comput. Math. Appl."},{"key":"1821_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992). https:\/\/doi.org\/10.1007\/BF01581204","journal-title":"Math. Program."},{"issue":"5","key":"1821_CR10","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1821_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1080\/10556789408805578","volume":"4","author":"J Eckstein","year":"1994","unstructured":"Eckstein, J.: Some saddle-function splitting methods for convex programming. Optim. Method. Softw. 4(1), 75\u201383 (1994). https:\/\/doi.org\/10.1080\/10556789408805578","journal-title":"Optim. Method. Softw."},{"issue":"1","key":"1821_CR12","doi-asserted-by":"publisher","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. Trend. Mach. Learn. 3(1), 1\u2013122 (2011). https:\/\/doi.org\/10.1561\/2200000016","journal-title":"Found. Trend. Mach. Learn."},{"key":"1821_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-012-0003-z","volume":"155","author":"D Han","year":"2012","unstructured":"Han, D., Yuan, X.: A note on the alternating direction method of multipliers. J. Optim. Theory Appl. 155, 227\u2013238 (2012). https:\/\/doi.org\/10.1007\/s10957-012-0003-z","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1821_CR14","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/140971178","volume":"25","author":"T Lin","year":"2015","unstructured":"Lin, T., Ma, S., Zhang, S.: On the global linear convergence of the ADMM with multiblock variables. SIAM J. Optim. 25(3), 1478\u20131497 (2015). https:\/\/doi.org\/10.1137\/140971178","journal-title":"SIAM J. Optim."},{"key":"1821_CR15","doi-asserted-by":"publisher","unstructured":"$$\\cal O\\it (1\/t)$$ complexity analysis of the generalized alternating direction method of multipliers. Sci. China Math. 62, 795\u2013808 (2019). https:\/\/doi.org\/10.1007\/s11425-016-9184-4","DOI":"10.1007\/s11425-016-9184-4"},{"key":"1821_CR16","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","volume":"81","author":"J Bai","year":"2022","unstructured":"Bai, J., Hager, W.W., Zhang, H.: An inexact accelerated stochastic ADMM for separable convex optimization. Comput. Optim. Appl. 81, 479\u2013518 (2022). https:\/\/doi.org\/10.1007\/s10589-021-00338-8","journal-title":"Comput. Optim. Appl."},{"key":"1821_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-022-01491-9","author":"VA Adona","year":"2023","unstructured":"Adona, V.A., Gonalves, M.L.N.: An inexact version of the symmetric proximal ADMM for solving separable convex optimization. Numer. Algor. (2023). https:\/\/doi.org\/10.1007\/s11075-022-01491-9","journal-title":"Numer. Algor."},{"key":"1821_CR18","doi-asserted-by":"publisher","unstructured":"Wang, F., Xu, Z., Xu, H.: Convergence of Bregman alternating direction method with multipliers for nonconvex composite problems. (2014) https:\/\/doi.org\/10.48550\/arXiv.1410.8625","DOI":"10.48550\/arXiv.1410.8625"},{"issue":"8","key":"1821_CR19","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1080\/00207160.2016.1227432","volume":"94","author":"K Guo","year":"2017","unstructured":"Guo, K., Han, D., Wu, T.: Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints. Int. J. Comput. Math. 94(8), 1653\u20131669 (2017). https:\/\/doi.org\/10.1080\/00207160.2016.1227432","journal-title":"Int. J. Comput. Math."},{"issue":"4","key":"1821_CR20","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s10898-022-01174-8","volume":"84","author":"M Yashtini","year":"2022","unstructured":"Yashtini, M.: Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization. J. Global Optim. 84(4), 913\u2013939 (2022). https:\/\/doi.org\/10.1007\/s10898-022-01174-8","journal-title":"J. Global Optim."},{"issue":"3","key":"1821_CR21","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Luo, Z.: A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. SIAM J. Optim. 30(3), 2272\u20132302 (2020). https:\/\/doi.org\/10.1137\/19M1242276","journal-title":"SIAM J. Optim."},{"key":"1821_CR22","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10898-019-00819-5","volume":"76","author":"X Gao","year":"2020","unstructured":"Gao, X., Cai, X., Han, D.: A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems. J. Global Optim. 76, 863\u2013887 (2020). https:\/\/doi.org\/10.1007\/s10898-019-00819-5","journal-title":"J. Global Optim."},{"issue":"6","key":"1821_CR23","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1080\/00207160.2020.1812585","volume":"98","author":"M Chao","year":"2021","unstructured":"Chao, M., Zhang, Y., Jian, J.: An inertial proximal alternating direction method of multipliers for nonconvex optimization. Int. J. Comput. Math. 98(6), 1199\u20131217 (2021). https:\/\/doi.org\/10.1080\/00207160.2020.1812585","journal-title":"Int. J. Comput. Math."},{"key":"1821_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-020-01782-y","volume":"188","author":"Z Jia","year":"2021","unstructured":"Jia, Z., Gao, X., Cai, X., Han, D.: Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems. J. Optim. Theory Appl. 188, 1\u201325 (2021). https:\/\/doi.org\/10.1007\/s10957-020-01782-y","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"1821_CR25","first-page":"1005","volume":"64","author":"J Jian","year":"2021","unstructured":"Jian, J., Liu, P., Jiang, X.: A partially symmetric regularized alternating direction method of multipliers for nonconvex multi-block optimization (in Chinese). Acta Math. Sin. Chin. Ser. 64(6), 1005\u20131026 (2021)","journal-title":"Acta Math. Sin. Chin. Ser."},{"issue":"2","key":"1821_CR26","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s10255-023-1048-5","volume":"39","author":"P Liu","year":"2023","unstructured":"Liu, P., Jian, J., Ma, G.: A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization. Acta Math. Appl. Sin. Engl. Ser. 39(2), 354\u2013380 (2023). https:\/\/doi.org\/10.1007\/s10255-023-1048-5","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"issue":"1","key":"1821_CR27","first-page":"78","volume":"43","author":"P Liu","year":"2023","unstructured":"Liu, P., Shao, H., Wang, Y., Wu, X.: Local linear convergence rate analysis of a symmetric ADMM with relaxation-step for nonconvex optimization (in Chinese). J. Systems Sci. Math. Sci. 43(1), 78\u201393 (2023)","journal-title":"J. Systems Sci. Math. Sci."},{"key":"1821_CR28","doi-asserted-by":"publisher","unstructured":"Fang, E.X., He, B., Liu, H., Yuan, X.: Generalized alternating direction method of multipliers: new theoretical insights and applications. Math. Prog. Comp. 7(2), 149\u2013187 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0078-2","DOI":"10.1007\/s12532-015-0078-2"},{"key":"1821_CR29","doi-asserted-by":"publisher","unstructured":"Chen, C., Ma, S., Yang, J.: A general inertial proximal point method for mixed variational inequality problem. (2014) https:\/\/doi.org\/10.48550\/arXiv.1407.8238","DOI":"10.48550\/arXiv.1407.8238"},{"issue":"1","key":"1821_CR30","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015). https:\/\/doi.org\/10.1137\/14095697X","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1821_CR31","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10589-019-00152-3","volume":"75","author":"B He","year":"2020","unstructured":"He, B., Ma, F., Yuan, X.: Optimally linearizing the alternating direction method of multipliers for convex programming. Comput. Optim. Appl. 75(2), 361\u2013388 (2020). https:\/\/doi.org\/10.1007\/s10589-019-00152-3","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1821_CR32","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: ipiano: Inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014). https:\/\/doi.org\/10.1137\/130942954","journal-title":"SIAM J. Imaging Sci."},{"key":"1821_CR33","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10851-015-0565-0","volume":"53","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Brox, T., Pock, T.: ipiasco: Inertial proximal algorithm for strongly convex optimization. J. Math. Imaging Vis. 53, 171\u2013181 (2015). https:\/\/doi.org\/10.1007\/s10851-015-0565-0","journal-title":"J. Math. Imaging Vis."},{"issue":"5","key":"1821_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964). https:\/\/doi.org\/10.1016\/0041-5553(64)90137-5","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"4","key":"1821_CR35","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1137\/S0363012998335802","volume":"38","author":"F Alvarez","year":"2000","unstructured":"Alvarez, F.: On the minimizing property of a second order dissipative system in Hilbert spaces. SIAM J. Control Optim. 38(4), 1102\u20131119 (2000). https:\/\/doi.org\/10.1137\/S0363012998335802","journal-title":"SIAM J. Control Optim."},{"key":"1821_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez, F., Attouch, H.: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 9, 3\u201311 (2001). https:\/\/doi.org\/10.1023\/A:1011253113155","journal-title":"Set-Valued Anal."},{"key":"1821_CR37","doi-asserted-by":"publisher","unstructured":"Bot, R.I., Csetnek, E.R.: An inertial alternating direction method of multipliers. (2014) https:\/\/doi.org\/10.48550\/arXiv.1404.4582","DOI":"10.48550\/arXiv.1404.4582"},{"key":"1821_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114821","volume":"420","author":"X Wang","year":"2023","unstructured":"Wang, X., Shao, H., Liu, P., Wu, T.: An inertial proximal partially symmetric admm-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications. J. Comput. Appl. Math. 420, 114821 (2023). https:\/\/doi.org\/10.1016\/j.cam.2022.114821","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1821_CR39","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2), 313\u2013340 (2012). https:\/\/doi.org\/10.1137\/110822347","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1821_CR40","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1080\/02331934.2011.611885","volume":"62","author":"B He","year":"2013","unstructured":"He, B., Tao, M., Xu, M., Yuan, X.: An alternating direction-based contraction method for linearly constrained separable convex programming problems. Optimization 62(4), 573\u2013596 (2013). https:\/\/doi.org\/10.1080\/02331934.2011.611885","journal-title":"Optimization"},{"key":"1821_CR41","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1090\/S0025-5718-2014-02829-9","volume":"83","author":"D Han","year":"2014","unstructured":"Han, D., Yuan, X., Zhang, W.: An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing. Math. Comp. 83, 2263\u20132291 (2014). https:\/\/doi.org\/10.1090\/S0025-5718-2014-02829-9","journal-title":"Math. Comp."},{"issue":"1\u20132","key":"1821_CR42","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"C Chen","year":"2016","unstructured":"Chen, C., He, B., Ye, Y., Yuan, X.: The direct extension of admm for multi-block convex minimization problems is not necessarily convergent. Math. Program. 155(1\u20132), 57\u201379 (2016). https:\/\/doi.org\/10.1007\/s10107-014-0826-5","journal-title":"Math. Program."},{"issue":"3","key":"1821_CR43","first-page":"135","volume":"23","author":"C Chen","year":"2019","unstructured":"Chen, C.: Some notes on the divergence example for multi-block alternating direction method of multipliers (in Chinese). Oper. Res. Trans 23(3), 135\u2013140 (2019)","journal-title":"Oper. Res. Trans"},{"key":"1821_CR44","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 semialgebraic 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."},{"key":"1821_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"3","key":"1821_CR46","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trend. Optim. 1(3), 127\u2013239 (2014). https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Proximal algorithms. Found. Trend. Optim."},{"key":"1821_CR47","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, Boston (2003)"},{"key":"1821_CR48","doi-asserted-by":"publisher","unstructured":"Goncalves, M.L.N., Melo, J.G., Monteiro, R.D.C.: Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems. Pac. J. Optim. 15(3), 379\u2013398 (2019). https:\/\/doi.org\/10.48550\/arXiv.1702.01850","DOI":"10.48550\/arXiv.1702.01850"},{"key":"1821_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-017-9367-6","volume":"61","author":"F Wang","year":"2018","unstructured":"Wang, F., Cao, W., Xu, Z.: Convergence of multi-block Bregman ADMM for nonconvex composite problems. Sci. China Inf. Sci. 61, 1\u201312 (2018). https:\/\/doi.org\/10.1007\/s11432-017-9367-6","journal-title":"Sci. China Inf. Sci."},{"issue":"456","key":"1821_CR50","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001). https:\/\/doi.org\/10.1198\/016214501753382273","journal-title":"J. Am. Stat. Assoc."},{"key":"1821_CR51","doi-asserted-by":"publisher","unstructured":"Fan, J.: Comments on \u00abwavelets in statistics: a review\u00bb by A. Antoniadis. J. Ital. Statist. Soc. 6(2), 131 (1997). https:\/\/doi.org\/10.1007\/BF03178906","DOI":"10.1007\/BF03178906"},{"key":"1821_CR52","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10589-019-00073-1","volume":"73","author":"Z Wu","year":"2019","unstructured":"Wu, Z., Li, M.: General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems. Comput. Optim. Appl. 73, 129\u2013158 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00073-1","journal-title":"Comput. Optim. Appl."},{"key":"1821_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12190-021-01590-1","volume":"68","author":"J Xu","year":"2021","unstructured":"Xu, J., Chao, M.: An inertial bregman generalized alternating direction method of multipliers for nonconvex optimization. J. Appl. Math. Comput. 68, 1\u201327 (2021). https:\/\/doi.org\/10.1007\/s12190-021-01590-1","journal-title":"J. Appl. Math. Comput."},{"key":"1821_CR54","doi-asserted-by":"publisher","unstructured":"$${L}_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE T. Neur. Net. Lear. 23(7), 1013\u20131027 (2012). https:\/\/doi.org\/10.1109\/TNNLS.2012.2197412","DOI":"10.1109\/TNNLS.2012.2197412"},{"issue":"11","key":"1821_CR55","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math. 57(11), 1413\u20131457 (2004). https:\/\/doi.org\/10.1002\/cpa.20042","journal-title":"Comm. Pure Appl. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01821-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01821-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01821-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T07:52:06Z","timestamp":1736841126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01821-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,13]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1821"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01821-z","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,13]]},"assertion":[{"value":"4 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The correct name of the city in the 2nd affiliation is Xuzhou","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}