{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T19:18:21Z","timestamp":1783192701302,"version":"3.54.6"},"reference-count":71,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004052","name":"King Abdullah University of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Mathematics with Applications"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.camwa.2026.04.029","type":"journal-article","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T19:03:42Z","timestamp":1778094222000},"page":"135-154","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Randomized subspace correction methods for convex optimization"],"prefix":"10.1016","volume":"215","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4388-4653","authenticated-orcid":false,"given":"Boou","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0496-649X","authenticated-orcid":false,"given":"Jongho","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8221-4656","authenticated-orcid":false,"given":"Jinchao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"237","key":"10.1016\/j.camwa.2026.04.029_bib0001","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1090\/S0025-5718-01-01311-4","article-title":"Global and uniform convergence of subspace correction methods for some convex optimization problems","volume":"71","author":"Tai","year":"2002","journal-title":"Math. Comp."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0002","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1137\/1034116","article-title":"Iterative methods by space decomposition and subspace correction","volume":"34","author":"Xu","year":"1992","journal-title":"SIAM Rev."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0003","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s10444-022-09943-5","article-title":"Fast gradient methods for uniformly convex and weakly smooth problems","volume":"48","author":"Park","year":"2022","journal-title":"Adv. Comput. Math."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0004","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/18M1224568","article-title":"Sharpness, restart, and acceleration","volume":"30","author":"Roulet","year":"2020","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0005","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1090\/S0894-0347-02-00398-3","article-title":"The method of alternating projections and the method of subspace corrections in Hilbert space","volume":"15","author":"Xu","year":"2002","journal-title":"J. Amer. Math. Soc."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0006","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/(SICI)1099-1506(199705\/06)4:3<177::AID-NLA106>3.0.CO;2-B","article-title":"Domain decomposition for a non-smooth convex minimization problem and its application to plasticity","volume":"4","author":"Carstensen","year":"1997","journal-title":"Numer. Linear Algebra Appl."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0007","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1137\/19M1300583","article-title":"Additive Schwarz methods for convex optimization as gradient methods","volume":"58","author":"Park","year":"2020","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0008","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10107-016-1057-8","article-title":"Iteration complexity analysis of block coordinate descent methods","volume":"163","author":"Hong","year":"2017","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0009","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/120891009","article-title":"A unified convergence analysis of block successive minimization methods for nonsmooth optimization","volume":"23","author":"Razaviyayn","year":"2013","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.camwa.2026.04.029_bib0010","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","article-title":"Convergence of a block coordinate descent method for nondifferentiable minimization","volume":"109","author":"Tseng","year":"2001","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0011","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1137\/120887795","article-title":"A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion","volume":"6","author":"Xu","year":"2013","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0012","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","article-title":"Coordinate descent algorithms","volume":"151","author":"Wright","year":"2015","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0013","doi-asserted-by":"crossref","first-page":"2037","DOI":"10.1137\/120887679","article-title":"On the convergence of block coordinate descent type methods","volume":"23","author":"Beck","year":"2013","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.camwa.2026.04.029_bib0014","series-title":"Advances in Neural Information Processing Systems","article-title":"Improved iteration complexity bounds of cyclic block coordinate descent for convex problems","volume":"28","author":"Sun","year":"2015"},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0015","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/100802001","article-title":"Efficiency of coordinate descent methods on huge-scale optimization problems","volume":"22","author":"Nesterov","year":"2012","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","article-title":"Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function","volume":"144","author":"Richt\u00e1rik","year":"2014","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0017","doi-asserted-by":"crossref","first-page":"2244","DOI":"10.1137\/141000270","article-title":"An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization","volume":"25","author":"Lin","year":"2015","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0018","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s10107-014-0800-2","article-title":"On the complexity analysis of randomized block-coordinate descent methods","volume":"152","author":"Lu","year":"2015","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0019","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1137\/130949993","article-title":"Accelerated, parallel, and proximal coordinate descent","volume":"25","author":"Fercoq","year":"2015","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0020","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/130950288","article-title":"Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds","volume":"26","author":"Necoara","year":"2016","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.camwa.2026.04.029_bib0021","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10107-015-0901-6","article-title":"Parallel coordinate descent methods for big data optimization","volume":"156","author":"Richt\u00e1rik","year":"2016","journal-title":"Math. Program."},{"key":"10.1016\/j.camwa.2026.04.029_bib0022","series-title":"Proceedings of the 36th International Conference on Machine Learning","first-page":"7313","article-title":"Global convergence of block coordinate descent in deep learning","volume":"97","author":"Zeng","year":"2019"},{"key":"10.1016\/j.camwa.2026.04.029_bib0023","series-title":"Advances in Neural Information Processing Systems","article-title":"Convergent block coordinate descent for training tikhonov regularized deep neural networks","volume":"30","author":"Zhang","year":"2017"},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0024","doi-asserted-by":"crossref","first-page":"1558","DOI":"10.1137\/S0036142996297461","article-title":"Rate of convergence of some space decomposition methods for linear and nonlinear problems","volume":"35","author":"Tai","year":"1998","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0025","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1137\/S003614290342995X","article-title":"Convergence rate of a Schwarz multilevel method for the constrained minimization of nonquadratic functionals","volume":"44","author":"Badea","year":"2006","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0026","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s00211-011-0423-y","article-title":"One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact","volume":"120","author":"Badea","year":"2012","journal-title":"Numer. Math."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0027","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1137\/S0036142901393607","article-title":"Convergence rate analysis of a multiplicative Schwarz method for variational inequalities","volume":"41","author":"Badea","year":"2003","journal-title":"SIAM J. Numer. Anal."},{"issue":"325","key":"10.1016\/j.camwa.2026.04.029_bib0028","doi-asserted-by":"crossref","first-page":"2249","DOI":"10.1090\/mcom\/3526","article-title":"Convergence analysis of the fast subspace descent method for convex optimization problems","volume":"89","author":"Chen","year":"2020","journal-title":"Math. Comp."},{"issue":"5","key":"10.1016\/j.camwa.2026.04.029_bib0029","doi-asserted-by":"crossref","first-page":"2655","DOI":"10.1093\/imanum\/drae068","article-title":"On the linear convergence of additive Schwarz methods for the p-Laplacian","volume":"45","author":"Lee","year":"2025","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0030","doi-asserted-by":"crossref","first-page":"A1373","DOI":"10.1137\/23M159545X","article-title":"Additive Schwarz methods for semilinear elliptic problems with convex energy functionals: convergence rate independent of nonlinearity","volume":"46","author":"Park","year":"2024","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0031","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/s10915-024-02718-8","article-title":"Additive schwarz methods for fourth-order variational inequalities","volume":"101","author":"Park","year":"2024","journal-title":"J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0032","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1137\/140965016","article-title":"Convergence rate of overlapping domain decomposition methods for the Rudin\u2013Osher\u2013Fatemi model based on a dual formulation","volume":"8","author":"Chang","year":"2015","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0033","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/s10915-014-9863-8","article-title":"Non-overlapping domain decomposition methods for dual total variation based image denoising","volume":"62","author":"Hinterm\u00fcller","year":"2015","journal-title":"J. Sci. Comput."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0034","doi-asserted-by":"crossref","first-page":"2009","DOI":"10.1137\/18M122604X","article-title":"Fast nonoverlapping block Jacobi method for the dual Rudin\u2013Osher\u2013Fatemi model","volume":"12","author":"Lee","year":"2019","journal-title":"SIAM J. Imaging Sci."},{"key":"10.1016\/j.camwa.2026.04.029_bib0035","series-title":"Domain Decomposition Methods-Algorithms and Theory","author":"Toselli","year":"2005"},{"issue":"7","key":"10.1016\/j.camwa.2026.04.029_bib0036","doi-asserted-by":"crossref","first-page":"1596","DOI":"10.1016\/j.laa.2012.04.052","article-title":"Greedy and randomized versions of the multiplicative Schwarz method","volume":"437","author":"Griebel","year":"2012","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.camwa.2026.04.029_bib0037","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40687-019-0187-z","article-title":"Randomized and fault-tolerant method of subspace corrections","volume":"6","author":"Hu","year":"2019","journal-title":"Res. Math. Sci."},{"issue":"1-2","key":"10.1016\/j.camwa.2026.04.029_bib0038","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10107-019-01437-5","article-title":"Worst-case complexity of cyclic coordinate descent: O(n2) gap with randomized version","volume":"185","author":"Sun","year":"2021","journal-title":"Math. Program."},{"key":"10.1016\/j.camwa.2026.04.029_bib0039","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S096249291600009X","article-title":"An introduction to continuous optimization for imaging","volume":"25","author":"Chambolle","year":"2016","journal-title":"Acta Numer."},{"key":"10.1016\/j.camwa.2026.04.029_bib0040","unstructured":"L. Chen, X. Hu, H. Wu, Randomized fast subspace descent methods, (2020). arXiv preprint arXiv: 2006.06589."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0041","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","article-title":"Gradient methods for minimizing composite functions","volume":"140","author":"Nesterov","year":"2013","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0042","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/130936361","article-title":"Stochastic block mirror descent methods for nonsmooth and stochastic optimization","volume":"25","author":"Dang","year":"2015","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.camwa.2026.04.029_bib0043","unstructured":"T. Gao, S. Lu, J. Liu, C. Chu, Randomized Bregman coordinate descent methods for non-Lipschitz optimization, (2020), arXiv preprint arXiv: 2001.05202."},{"issue":"1-2","key":"10.1016\/j.camwa.2026.04.029_bib0044","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-015-0969-z","article-title":"Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization","volume":"160","author":"Hua","year":"2016","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0045","doi-asserted-by":"crossref","first-page":"A2421","DOI":"10.1137\/23M1594200","article-title":"A full approximation scheme multilevel method for nonlinear variational inequalities","volume":"46","author":"Bueler","year":"2024","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0046","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s002110200404","article-title":"Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities","volume":"93","author":"Tai","year":"2003","journal-title":"Numer. Math."},{"key":"10.1016\/j.camwa.2026.04.029_bib0047","doi-asserted-by":"crossref","DOI":"10.1090\/mcom\/4172","article-title":"Parallel subspace correction methods for semicoercive and nearly semicoercive convex optimization with applications to nonlinear PDEs","author":"Lee","year":"2025","journal-title":"Math. Comp."},{"key":"10.1016\/j.camwa.2026.04.029_bib0048","unstructured":"J. Park, J. Xu, Theory of Parallel Subspace Correction Methods for Smooth Convex Optimization, 2025. Domain Decomposition Methods in Science and Engineering XXVIII."},{"key":"10.1016\/j.camwa.2026.04.029_bib0049","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1017\/S0962492917000083","article-title":"Algebraic multigrid methods","volume":"26","author":"Xu","year":"2017","journal-title":"Acta Numer."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0050","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/13094829X","article-title":"On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes","volume":"25","author":"Beck","year":"2015","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.camwa.2026.04.029_bib0051","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1080\/10556788.2016.1190360","article-title":"Coordinate descent with arbitrary sampling I: algorithms and complexity","volume":"31","author":"Qu","year":"2014","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.camwa.2026.04.029_bib0052","series-title":"Proceedings of the 33Rd International Conference on Machine Learning","first-page":"1110","article-title":"Even faster accelerated coordinate descent using non-uniform sampling","author":"Allen-Zhu","year":"2016"},{"issue":"1-2","key":"10.1016\/j.camwa.2026.04.029_bib0053","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","article-title":"Universal gradient methods for convex optimization problems","volume":"152","author":"Nesterov","year":"2015","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0054","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","article-title":"The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems","volume":"17","author":"Bolte","year":"2007","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.camwa.2026.04.029_bib0055","unstructured":"B. Jiang, J. Park, J. Xu, Connections between convex optimization algorithms and subspace correction methods, (2025), arXiv preprint arXiv: 2505.09765."},{"key":"10.1016\/j.camwa.2026.04.029_bib0056","series-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"Bauschke","year":"2011"},{"key":"10.1016\/j.camwa.2026.04.029_bib0057","series-title":"Hilbert Space Splittings and Iterative Methods","author":"Griebel","year":"2024"},{"issue":"6","key":"10.1016\/j.camwa.2026.04.029_bib0058","doi-asserted-by":"crossref","first-page":"A3681","DOI":"10.1137\/24M1650247","article-title":"Two-level overlapping Schwarz preconditioners with universal coarse spaces for 2mth-Order elliptic problems","volume":"46","author":"Park","year":"2024","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.camwa.2026.04.029_bib0059","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1553\/etna_vol54s176","article-title":"Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization","volume":"54","author":"Park","year":"2021","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0060","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/18M1173782","article-title":"Overlapping domain decomposition methods for total variation denoising","volume":"57","author":"Langer","year":"2019","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0061","doi-asserted-by":"crossref","first-page":"B403","DOI":"10.1137\/15M1049919","article-title":"Primal domain decomposition methods for the total variation minimization, based on dual decomposition","volume":"39","author":"Lee","year":"2017","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0062","article-title":"Stochastic dual coordinate ascent methods for regularized loss minimization","volume":"14","author":"Shalev-Shwartz","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.camwa.2026.04.029_bib0063","series-title":"Proceedings of the 31st International Conference on Machine Learning","first-page":"64","article-title":"Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization","volume":"32","author":"Shalev-Shwartz","year":"2014"},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0064","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1137\/S0036139903422784","article-title":"Total bounded variation regularization as a bilaterally constrained optimization problem","volume":"64","author":"Kunisch","year":"2004","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0065","doi-asserted-by":"crossref","first-page":"B205","DOI":"10.1137\/18M1165499","article-title":"A finite element approach for the dual Rudin\u2013Osher\u2013Fatemi model and its nonoverlapping domain decomposition methods","volume":"41","author":"Lee","year":"2019","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10.1016\/j.camwa.2026.04.029_bib0066","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","article-title":"Incremental proximal methods for large scale convex optimization","volume":"129","author":"Bertsekas","year":"2011","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0067","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1137\/22M1488752","article-title":"Regularized Newton method with global convergence","volume":"33","author":"Mishchenko","year":"2023","journal-title":"SIAM J. Optim."},{"issue":"4","key":"10.1016\/j.camwa.2026.04.029_bib0068","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1137\/140963303","article-title":"An L1 penalty method for general obstacle problems","volume":"75","author":"Tran","year":"2015","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0069","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","article-title":"Adaptive restart for accelerated gradient schemes","volume":"15","author":"O\u2019Donoghue","year":"2015","journal-title":"Found. Comput. Math."},{"issue":"1","key":"10.1016\/j.camwa.2026.04.029_bib0070","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00211-012-0479-3","article-title":"An additive analysis of multiplicative Schwarz methods","volume":"123","author":"Brenner","year":"2013","journal-title":"Numer. Math."},{"issue":"3","key":"10.1016\/j.camwa.2026.04.029_bib0071","doi-asserted-by":"crossref","first-page":"2160","DOI":"10.1137\/22M148700X","article-title":"Random coordinate descent methods for nonseparable composite optimization","volume":"33","author":"Chorobura","year":"2023","journal-title":"SIAM J. Optim."}],"container-title":["Computers &amp; Mathematics with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089812212600194X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089812212600194X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T19:13:43Z","timestamp":1783192423000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S089812212600194X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":71,"alternative-id":["S089812212600194X"],"URL":"https:\/\/doi.org\/10.1016\/j.camwa.2026.04.029","relation":{},"ISSN":["0898-1221"],"issn-type":[{"value":"0898-1221","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Randomized subspace correction methods for convex optimization","name":"articletitle","label":"Article Title"},{"value":"Computers & Mathematics with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.camwa.2026.04.029","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}