{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T14:46:02Z","timestamp":1772635562681,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Guangxi Science and Technology Program","award":["AD23023001"],"award-info":[{"award-number":["AD23023001"]}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2025GXNSFAA069772"],"award-info":[{"award-number":["2025GXNSFAA069772"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171106"],"award-info":[{"award-number":["12171106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12401403"],"award-info":[{"award-number":["12401403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261008"],"award-info":[{"award-number":["12261008"]}],"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":[[2026,3]]},"DOI":"10.1007\/s10915-026-03206-x","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T03:38:18Z","timestamp":1770608298000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Inexact Accelerated Stochastic PRSM with Convex Combination Proximal Centers for Separable Convex Optimization"],"prefix":"10.1007","volume":"106","author":[{"given":"Jinbao","family":"Jian","sequence":"first","affiliation":[]},{"given":"Xianke","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Jianghua","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Wenrui","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Guodong","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"issue":"1","key":"3206_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11075-022-01491-9","volume":"94","author":"VA Adona","year":"2023","unstructured":"Adona, V.A., Gon\u00e7alves, M.L.: An inexact version of the symmetric proximal ADMM for solving separable convex optimization. Numer. Algor. 94(1), 1\u201328 (2023)","journal-title":"Numer. Algor."},{"key":"3206_CR2","unstructured":"Azadi, S., Sra, S.: Towards an optimal stochastic alternating direction method of multipliers. In: Xing, EP., Jebara, T. (eds.) Proceedings of the 31st International Conference on Machine Learning, vol.32 of Proceedings of Machine Learning Research, Bejing, China, 22-24 PMLR, pp. 620\u2013628 (2014)"},{"issue":"4","key":"3206_CR3","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s40305-023-00470-8","volume":"11","author":"JC Bai","year":"2023","unstructured":"Bai, J.C., Bian, F.M., Chang, X.K., Du, L.: Accelerated stochastic Peaceman-Rachford method for empirical risk minimization. J. Oper. Res. Soc. China 11(4), 783\u2013807 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"key":"3206_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10915-025-02802-7","volume":"102","author":"JC Bai","year":"2025","unstructured":"Bai, J.C., Chen, Y., Yu, X., Zhang, H.C.: Generalized asymmetric Forward-Backward-adjoint algorithms for convex-concave saddle-point problem. J. Sci. Comput. 102, 80 (2025)","journal-title":"J. Sci. Comput."},{"issue":"6","key":"3206_CR5","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.4208\/jcm.2305-m2021-0107","volume":"42","author":"JC Bai","year":"2024","unstructured":"Bai, J.C., Guo, K., Liang, J.L., Jing, Y., So, H.C.: Accelerated symmetric ADMM and its applications in large-scale signal processing. J. Comput. Math. 42(6), 1605\u20131626 (2024)","journal-title":"J. Comput. Math."},{"issue":"2","key":"3206_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","volume":"81","author":"JC Bai","year":"2022","unstructured":"Bai, J.C., Hager, W.W., Zhang, H.C.: An inexact accelerated stochastic ADMM for separable convex optimization. Comput. Optim. Appl. 81(2), 479\u2013518 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"3206_CR7","doi-asserted-by":"publisher","first-page":"448","DOI":"10.4208\/csiam-am.SO-2021-0021","volume":"3","author":"JC Bai","year":"2022","unstructured":"Bai, J.C., Han, D.R., Sun, H., Zhang, H.C.: Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes. CSIAM Trans. Appl. Math. 3(3), 448\u2013479 (2022)","journal-title":"CSIAM Trans. Appl. Math."},{"issue":"1","key":"3206_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10589-017-9971-0","volume":"70","author":"JC Bai","year":"2018","unstructured":"Bai, J.C., Li, J.C., Xu, F.M., Zhang, H.C.: Generalized symmetric ADMM for separable convex optimization. Comput. Optim. Appl. 70(1), 129\u2013170 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"3206_CR9","doi-asserted-by":"crossref","unstructured":"Bai, J.C., Zhang M., Zhang H.C.: An inexact ADMM for separable nonconvex and nonsmooth optimization. Comput. Optim. Appl. 1\u201335 (2025)","DOI":"10.1007\/s10589-024-00643-y"},{"key":"3206_CR10","doi-asserted-by":"publisher","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 (2017)"},{"issue":"1","key":"3206_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"3206_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. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"3206_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01452-9","volume":"87","author":"XK Chang","year":"2021","unstructured":"Chang, X.K., Yang, J.F.: A golden ratio primal-dual algorithm for structured convex optimization. J. Sci. Comput. 87, 1\u201326 (2021)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"3206_CR14","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1137\/21M1420319","volume":"32","author":"XK Chang","year":"2022","unstructured":"Chang, X.K., Yang, J.F., Zhang, H.C.: Golden ratio primal-dual algorithm with linesearch. SIAM J. Optim. 32(3), 1584\u20131613 (2022)","journal-title":"SIAM J. Optim."},{"key":"3206_CR15","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/s10957-018-1270-0","volume":"179","author":"C Chen","year":"2018","unstructured":"Chen, C., Chen, Y., Ouyang, Y., Pasiliao, E.: Stochastic accelerated alternating direction method of multipliers with importance sampling. J. Optim. Theory Appl. 179, 676\u2013695 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"3206_CR16","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10898-022-01154-y","volume":"87","author":"HM Chen","year":"2023","unstructured":"Chen, H.M., Gu, G.Y., Yang, J.F.: A golden ratio proximal alternating direction method of multipliers for separable convex optimization. J. Global Optim. 87(2), 581\u2013602 (2023)","journal-title":"J. Global Optim."},{"key":"3206_CR17","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1007\/s11075-019-00731-9","volume":"83","author":"J Chen","year":"2020","unstructured":"Chen, J., Wang, Y., He, H., Lv, Y.: Convergence analysis of positive-indefinite proximal ADMM with a Glowinski\u2019s relaxation factor. Numer. Algor. 83, 1415\u20131440 (2020)","journal-title":"Numer. Algor."},{"issue":"1","key":"3206_CR18","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 Sotfw. 4(1), 75\u201383 (1994)","journal-title":"Optim. Method Sotfw."},{"key":"3206_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"Eckstein, J., Silva, P.J.: A practical relative error criterion for augmented Lagrangians. Math. Program. 141, 319\u2013348 (2013)","journal-title":"Math. Program."},{"key":"3206_CR20","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10107-017-1160-5","volume":"170","author":"J Eckstein","year":"2018","unstructured":"Eckstein, J., Yao, W.: Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM. Math. Program. 170, 417\u2013444 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"3206_CR21","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"T Friedman","year":"2008","unstructured":"Friedman, T., Hastie, T., Tibshirani, R.: Spare inverse covariance estimation with the graphical lasso. Biostatistics 9(3), 432\u2013441 (2008)","journal-title":"Biostatistics"},{"issue":"1","key":"3206_CR22","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)","journal-title":"Comput. Math. Appl."},{"key":"3206_CR23","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","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\u00e9mes de dirichlet non lin\u00e9aires. ESAIM: Mathematical Modelling and Numerical Analysis-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 9, 41\u201376 (1975)","journal-title":"Mathematical Modelling and Numerical Analysis-Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique"},{"key":"3206_CR24","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.4208\/jcm.2112-m2020-0023","volume":"41","author":"Y Gu","year":"2022","unstructured":"Gu, Y., Jiang, B., Han, D.R.: An indefinite-proximal-based strictly contractive Peaceman-Rachford splitting method. J. Comput. Math. 41, 1017\u20131040 (2022)","journal-title":"J. Comput. Math."},{"issue":"1","key":"3206_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40305-021-00368-3","volume":"10","author":"DR Han","year":"2022","unstructured":"Han, D.R.: A survey on some recent developments of alternating direction method of multipliers. J. Oper. Res. Soc. China 10(1), 1\u201352 (2022)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"3","key":"3206_CR26","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/15M1044448","volume":"9","author":"BS He","year":"2016","unstructured":"He, B.S., Ma, F., Yuan, X.M.: Convergence study on the symmetric version of ADMM with larger step sizes. SIAM J. Imaging Sci. 9(3), 1467\u20131501 (2016)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"3206_CR27","first-page":"58","volume":"11","author":"J Hu","year":"2023","unstructured":"Hu, J., Hu, Q.M.: A symmetric linearzed alternating direction method of multipliers for a class of stochastic optimization problems. J. Systems Sci. Inform. 11(1), 58\u201377 (2023)","journal-title":"J. Systems Sci. Inform."},{"issue":"4","key":"3206_CR28","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1007\/s10473-025-0424-z","volume":"45","author":"JB Jian","year":"2025","unstructured":"Jian, J.B., Tang, X.K., Yin, J.H., Jiang, X.Z.: An inexact symmetric proximal ADMM with convex combination proximal centers for separable convex programming. Acta Math. Sci. 45(4), 1701\u20131722 (2025)","journal-title":"Acta Math. Sci."},{"key":"3206_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114628","volume":"417","author":"F Jiang","year":"2023","unstructured":"Jiang, F., Wu, Z.M.: An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems. J. Comput. Appl. Math. 417, 114628 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"3206_CR30","first-page":"315","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Proc. Adv. Neural Inf. Process. Syst. 26, 315\u2013323 (2013)","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"issue":"8","key":"3206_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pgen.1000587","volume":"5","author":"S Kim","year":"2009","unstructured":"Kim, S., Xing, E.P.: Statistical estimation of correlated genome associations to a quantitative trait network. PLoS Genet. 5(8), 1\u201318 (2009)","journal-title":"PLoS Genet."},{"key":"3206_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and stochastic optimization methods for machine learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-order and stochastic optimization methods for machine learning. Springer, New York (2020)"},{"key":"3206_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13660-017-1405-0","volume":"2017","author":"J Liu","year":"2017","unstructured":"Liu, J., Duan, Y., Sun, M.: A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming. J. Inequal. Appl. 2017, 1\u201321 (2017)","journal-title":"J. Inequal. Appl."},{"key":"3206_CR34","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.apnum.2022.10.015","volume":"184","author":"YX Ma","year":"2023","unstructured":"Ma, Y.X., Bai, J.C., Sun, H.: An inexact ADMM with proximal-indefinite term and larger stepsize. Appl. Numer. Math. 184, 542\u2013566 (2023)","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"3206_CR35","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-019-01416-w","volume":"184","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y.: Golden ratio algorithms for variational inequalities. Math. Program. 184(1), 383\u2013410 (2020)","journal-title":"Math. Program."},{"key":"3206_CR36","unstructured":"Nicolas, L.R., Mark, W.S., Francis, B.: A stochastic gradient method with an exponential convergence rate for finite training sets. Proc. Adv. Neural Inf. Process. Syst. 2672-2680 (2012)"},{"key":"3206_CR37","volume-title":"Numerical Optimization 2nd","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization 2nd. Springer, New York (2006)"},{"key":"3206_CR38","unstructured":"Ouyang, H., He, N., Tran, L., Gray, A.: Stochastic alternating direction method of multipliers. In: Dasgupta, S., McAllester, D. (eds.) Proceedings of the 30th International Conference on Machine Learning, vol.28 of Proceedings of Machine Learning Research, Atlanta, Georgia, USA, 17\u201319, PMLR, pp.80\u201388 (2013)"},{"issue":"3","key":"3206_CR39","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Statist. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Statist."},{"key":"3206_CR40","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex analysis. Princeton Universerty Press, Princeton, NJ (1970)"},{"issue":"1","key":"3206_CR41","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14(1), 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"3206_CR42","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/130910774","volume":"24","author":"R Shefi","year":"2014","unstructured":"Shefi, R., Teboulle, M.: Rate of convergence analysis of decomposition methods based on the proximal method of multipliers for convex minimization. SIAM J. Optim. 24(1), 269\u2013297 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"3206_CR43","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7(4), 323\u2013345 (1999)","journal-title":"Set-Valued Anal."},{"key":"3206_CR44","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/moor.25.2.214.12222","volume":"25","author":"MV Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math. Oper. Res. 25, 214\u2013230 (2000)","journal-title":"Math. Oper. Res."},{"key":"3206_CR45","unstructured":"Suzuki, T.: Stochastic dual coordinate ascent with alternating direction method of multipliers. Proc. Int. Conf. Mach. Learn. 736\u2013744 (2014)"},{"key":"3206_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2025.116693","volume":"470","author":"XK Tang","year":"2025","unstructured":"Tang, X.K., Yin, J.H., Jian, D., Han, D.L.: An indefinite proximal Peaceman-Rachford splitting method-based algorithm integrating the generalization acceleration technique for separable convex programming problems in image restoration. J. Comput. Appl. Math. 470, 116693 (2025)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"3206_CR47","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10589-020-00206-x","volume":"77","author":"M Tao","year":"2020","unstructured":"Tao, M.: Convergence study of indefnite proximal ADMM with a relaxation factor. Comput. Optim. Appl. 77(1), 91\u2013123 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"3206_CR48","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.M.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21(1), 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3206_CR49","doi-asserted-by":"publisher","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 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"2","key":"3206_CR50","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s11590-023-01997-8","volume":"18","author":"ZM Wu","year":"2024","unstructured":"Wu, Z.M., Song, Y., Jiang, F.: Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems. Optim. Lett. 18(2), 447\u2013470 (2024)","journal-title":"Optim. Lett."},{"key":"3206_CR51","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s11590-016-1021-9","volume":"11","author":"J Xie","year":"2017","unstructured":"Xie, J., Liao, A., Yang, X.: An inexact alternating direction method of multipliers with relative error criteria. Optim. Lett. 11, 583\u2013596 (2017)","journal-title":"Optim. Lett."},{"key":"3206_CR52","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.apnum.2023.09.003","volume":"195","author":"J Yin","year":"2024","unstructured":"Yin, J., Jian, J., Jiang, X., Wu, J., Ma, G.: A proximal fully parallel splitting method with a relaxation factor for separable convex programming. Appl. Numer. Math. 195, 17\u201338 (2024)","journal-title":"Appl. Numer. Math."},{"issue":"4","key":"3206_CR53","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s10898-024-01384-2","volume":"89","author":"J Yin","year":"2024","unstructured":"Yin, J., Tang, C., Jian, J., Huang, Q.: A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization. J. Global Optim. 89(4), 899\u2013926 (2024)","journal-title":"J. Global Optim."},{"key":"3206_CR54","unstructured":"Zhao, S., Li, W., Zhou, Z.: Scalable stochastic alternating direction method of multipliers. arXiv:1502.03529 (2015)"},{"key":"3206_CR55","unstructured":"Zhong, W., Kwok, J.: Fast stochastic alternating direction method of multipliers. Proc. Int. Conf. Mach. Learn. 46\u201354 (2014)"},{"issue":"3","key":"3206_CR56","first-page":"1","volume":"41","author":"DQ Zhou","year":"2023","unstructured":"Zhou, D.Q., Xu, H., Yang, J.F.: Proximal alternating direction method of multipliers with convex combination proximal centers. Asia-Pac. J. Oper. Res. 41(3), 1\u201328 (2023)","journal-title":"Asia-Pac. J. Oper. Res."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03206-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03206-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03206-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:02:39Z","timestamp":1772611359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03206-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["3206"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03206-x","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"22 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","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":"73"}}