{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T11:16:51Z","timestamp":1760267811121,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["2019R1A6A1A10073887"],"award-info":[{"award-number":["2019R1A6A1A10073887"]}],"id":[{"id":"10.13039\/501100002701","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":[[2021,12]]},"DOI":"10.1007\/s10915-021-01648-z","type":"journal-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T07:34:28Z","timestamp":1634715268000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Accelerated Additive Schwarz Methods for Convex Optimization with Adaptive Restart"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0496-649X","authenticated-orcid":false,"given":"Jongho","family":"Park","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"issue":"2","key":"1648_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1137\/S003614290342995X","volume":"44","author":"L Badea","year":"2006","unstructured":"Badea, L.: Convergence rate of a Schwarz multilevel method for the constrained minimization of nonquadratic functionals. SIAM J. Numer. Anal. 44(2), 449\u2013477 (2006)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"1648_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00211-011-0423-y","volume":"120","author":"L Badea","year":"2012","unstructured":"Badea, L., Krause, R.: One-and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact. Numer. Math. 120(4), 573\u2013599 (2012)","journal-title":"Numer. Math."},{"issue":"3","key":"1648_CR3","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1137\/S0036142901393607","volume":"41","author":"L Badea","year":"2003","unstructured":"Badea, L., Tai, X.C., Wang, J.: Convergence rate analysis of a multiplicative Schwarz method for variational inequalities. SIAM J. Numer. Anal. 41(3), 1052\u20131073 (2003)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"1648_CR4","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."},{"key":"1648_CR5","doi-asserted-by":"crossref","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the \u201cFast Iterative Shrinkage\/Thresholding Algorithm\u201d. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015)","DOI":"10.1007\/s10957-015-0746-4"},{"key":"1648_CR6","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)","journal-title":"Acta Numer."},{"issue":"1","key":"1648_CR7","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1137\/140965016","volume":"8","author":"H Chang","year":"2015","unstructured":"Chang, H., Tai, X.C., Wang, L.L., Yang, D.: Convergence rate of overlapping domain decomposition methods for the Rudin\u2013Osher\u2013Fatemi model based on a dual formulation. SIAM J. Imaging Sci. 8(1), 564\u2013591 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"1648_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719208","volume-title":"The Finite Element Method for Elliptic Problems","author":"PG Ciarlet","year":"2002","unstructured":"Ciarlet, P.G.: The Finite Element Method for Elliptic Problems. SIAM, Philadelphia (2002)"},{"issue":"4","key":"1648_CR9","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"1\u20132","key":"1648_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-013-0653-0","volume":"145","author":"Y Drori","year":"2014","unstructured":"Drori, Y., Teboulle, M.: Performance of first-order methods for smooth convex minimization: a novel approach. Math. Program. 145(1\u20132), 451\u2013482 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"1648_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10851-018-0852-7","volume":"61","author":"M Herrmann","year":"2019","unstructured":"Herrmann, M., Herzog, R., Schmidt, S., Vidal-N\u00fa\u00f1ez, J., Wachsmuth, G.: Discrete total variation with finite elements and applications to imaging. J. Math. Imaging Vis. 61(4), 411\u2013431 (2019)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"1648_CR12","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s10915-014-9863-8","volume":"62","author":"M Hinterm\u00fcller","year":"2015","unstructured":"Hinterm\u00fcller, M., Langer, A.: Non-overlapping domain decomposition methods for dual total variation based image denoising. J. Sci. Comput. 62(2), 456\u2013481 (2015)","journal-title":"J. Sci. Comput."},{"issue":"1\u20132","key":"1648_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10107-015-0949-3","volume":"159","author":"D Kim","year":"2016","unstructured":"Kim, D., Fessler, J.A.: Optimized first-order methods for smooth convex minimization. Math. Program. 159(1\u20132), 81\u2013107 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"1648_CR14","doi-asserted-by":"publisher","first-page":"B205","DOI":"10.1137\/18M1165499","volume":"41","author":"CO Lee","year":"2019","unstructured":"Lee, C.O., Park, E.H., Park, J.: A finite element approach for the dual Rudin\u2013Osher\u2013Fatemi model and its nonoverlapping domain decomposition methods. SIAM J. Sci. Comput. 41(2), B205\u2013B228 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1648_CR15","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1137\/18M122604X","volume":"12","author":"CO Lee","year":"2019","unstructured":"Lee, C.O., Park, J.: Fast nonoverlapping block Jacobi method for the dual Rudin\u2013Osher\u2013Fatemi model. SIAM J. Imaging Sci. 12(4), 2009\u20132034 (2019)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"1648_CR16","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1007\/s10915-019-01085-z","volume":"81","author":"CO Lee","year":"2019","unstructured":"Lee, C.O., Park, J.: A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations. J. Sci. Comput. 81(3), 2331\u20132355 (2019)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"1648_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1648_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer, Cham (2018)"},{"key":"1648_CR19","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $${O}(1\/k^2)$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"1648_CR20","doi-asserted-by":"crossref","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)","DOI":"10.1007\/s10208-013-9150-3"},{"issue":"3","key":"1648_CR21","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1137\/19M1300583","volume":"58","author":"J Park","year":"2020","unstructured":"Park, J.: Additive Schwarz methods for convex optimization as gradient methods. SIAM J. Numer. Anal. 58(3), 1495\u20131530 (2020)","journal-title":"SIAM J. Numer. Anal."},{"key":"1648_CR22","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1553\/etna_vol54s176","volume":"54","author":"J Park","year":"2021","unstructured":"Park, J.: Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization. Electron. Trans. Numer. Anal. 54, 176\u2013197 (2021)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1648_CR23","doi-asserted-by":"crossref","unstructured":"Roulet, V., d\u2019Aspremont, A.: Sharpness, restart, and acceleration. SIAM J. Optim. 30(1), 262\u2013289 (2020)","DOI":"10.1137\/18M1224568"},{"key":"1648_CR24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)"},{"issue":"4","key":"1648_CR25","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s002110200404","volume":"93","author":"XC Tai","year":"2003","unstructured":"Tai, X.C.: Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities. Numer. Math. 93(4), 755\u2013786 (2003)","journal-title":"Numer. Math."},{"key":"1648_CR26","unstructured":"Tai, X.C., Heimsund, B., Xu, J.: Rate of convergence for parallel subspace correction methods for nonlinear variational inequalities. In: Domain decomposition methods in science and engineering (Lyon, 2000), Theory Eng. Appl. Comput. Methods, pp. 127\u2013138. Internat. Center Numer. Methods Eng. (CIMNE), Barcelona (2002)"},{"issue":"237","key":"1648_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1090\/S0025-5718-01-01311-4","volume":"71","author":"XC Tai","year":"2002","unstructured":"Tai, X.C., Xu, J.: Global and uniform convergence of subspace correction methods for some convex optimization problems. Math. Comput. 71(237), 105\u2013124 (2002)","journal-title":"Math. Comput."},{"issue":"1","key":"1648_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 170(1), 67\u201396 (2018)","journal-title":"Math. Program."},{"key":"1648_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/b137868","volume-title":"Domain Decomposition Methods-Algorithms and Theory","author":"A Toselli","year":"2005","unstructured":"Toselli, A., Widlund, O.: Domain Decomposition Methods-Algorithms and Theory. Springer, Berlin (2005)"},{"issue":"4","key":"1648_CR30","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1137\/1034116","volume":"34","author":"J Xu","year":"1992","unstructured":"Xu, J.: Iterative methods by space decomposition and subspace correction. SIAM Rev. 34(4), 581\u2013613 (1992)","journal-title":"SIAM Rev."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01648-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-021-01648-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01648-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T07:19:30Z","timestamp":1637651970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-021-01648-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,19]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1648"],"URL":"https:\/\/doi.org\/10.1007\/s10915-021-01648-z","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2021,10,19]]},"assertion":[{"value":"2 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","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 author declares that he has no conflicts of interest\/competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The source code used to generate all data for the current study is available from the corresponding author upon request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"58"}}