{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:10:29Z","timestamp":1772712629324,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:00:00Z","timestamp":1553904000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001361","name":"Faculty of Science, National University of Singapore","doi-asserted-by":"publisher","award":["R-146-000-214-112"],"award-info":[{"award-number":["R-146-000-214-112"]}],"id":[{"id":"10.13039\/501100001361","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10957-019-01512-z","type":"journal-article","created":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:02:55Z","timestamp":1553925775000},"page":"1019-1049","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dykstra\u2019s Splitting and an Approximate Proximal Point Algorithm for Minimizing the Sum of Convex Functions"],"prefix":"10.1007","volume":"182","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7209-3013","authenticated-orcid":false,"given":"Chin How Jeffrey","family":"Pang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,30]]},"reference":[{"key":"1512_CR1","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1080\/01621459.1983.10477029","volume":"78","author":"R Dykstra","year":"1983","unstructured":"Dykstra, R.: An algorithm for restricted least-squares regression. J. Am. Stat. Assoc. 78, 837\u2013842 (1983)","journal-title":"J. Am. Stat. Assoc."},{"key":"1512_CR2","doi-asserted-by":"crossref","unstructured":"Boyle, J., Dykstra, R.: A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Dykstra, R., Robertson, T., Wright, F.T. (eds.) Advances in Order Restricted Statistical Inference. Lecture notes in Statistics, pp. 28\u201347. Springer, New York (1985)","DOI":"10.1007\/978-1-4613-9940-7_3"},{"key":"1512_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580719","volume":"40","author":"S Han","year":"1988","unstructured":"Han, S.: A successive projection method. Math. Program. 40, 1\u201314 (1988)","journal-title":"Math. Program."},{"key":"1512_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02614077","volume":"36","author":"N Gaffke","year":"1989","unstructured":"Gaffke, N., Mathar, R.: A cyclic projection algorithm via duality. Metrika 36, 29\u201354 (1989)","journal-title":"Metrika"},{"key":"1512_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582891","volume":"52","author":"A Iusem","year":"1991","unstructured":"Iusem, A., Pierro, A.D.: On the convergence of Han\u2019s method of convex programming with quadratic objective. Math. Program. 52, 265\u2013284 (1991)","journal-title":"Math. Program."},{"key":"1512_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra, G.: Decomposition through formalization in a product space. Math. Program. 28, 96\u2013115 (1984)","journal-title":"Math. Program."},{"key":"1512_CR7","first-page":"335","volume":"77","author":"H Hundal","year":"1997","unstructured":"Hundal, H., Deutsch, F.: Two generalizations of Dykstra\u2019s cyclic projections algorithm. Math. Program. 77, 335\u2013355 (1997)","journal-title":"Math. Program."},{"issue":"4","key":"1512_CR8","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1137\/16M106090X","volume":"26","author":"C Pang","year":"2016","unstructured":"Pang, C.: The supporting halfspace\u2014quadratic programming strategy for the dual of the best approximation problem. SIAM J. Optim. 26(4), 2591\u20132619 (2016)","journal-title":"SIAM J. Optim."},{"key":"1512_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S1570-579X(01)80013-6","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications","author":"F Deutsch","year":"2001","unstructured":"Deutsch, F.: Accelerating the convergence of the method of alternating projections via a line search: a brief survey. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 203\u2013217. Elsevier, Amsterdam (2001)"},{"key":"1512_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best Approximation in Inner Product Spaces. CMS Books in Mathematics","author":"F Deutsch","year":"2001","unstructured":"Deutsch, F.: Best Approximation in Inner Product Spaces. CMS Books in Mathematics. Springer, Berlin (2001)"},{"key":"1512_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"key":"1512_CR12","doi-asserted-by":"crossref","unstructured":"Escalante, R., Raydan, M.: Alternating Projection Methods. SIAM, Philadelphia, PA (2011)","DOI":"10.1137\/9781611971941"},{"issue":"4","key":"1512_CR13","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1512_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/13094829X","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck, A.: On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes. SIAM J. Optim. 25(1), 185\u2013209 (2015)","journal-title":"SIAM J. Optim."},{"issue":"117","key":"1512_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. Ser. B 117(117), 387\u2013423 (2009)","journal-title":"Math. Program. Ser. B"},{"key":"1512_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10957-008-9458-3","volume":"140","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization. J. Optim. Theory Appl. 140, 513\u2013535 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"1512_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. 151, 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"1512_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-016-1057-8","volume":"163","author":"M Hong","year":"2017","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.: Iteration complexity analysis of block coordinate descent methods. Math. Program. 163, 85\u2013114 (2017)","journal-title":"Math. Program."},{"key":"1512_CR19","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informat. Rech. Op\u00e9r. 4, 154\u2013158 (1970)","journal-title":"Rev. Fran\u00e7aise Informat. Rech. Op\u00e9r."},{"key":"1512_CR20","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R Rockafellar","year":"1976","unstructured":"Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"1512_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/moor.14.2.237","volume":"14","author":"S Han","year":"1989","unstructured":"Han, S.: A decomposition method and its application to convex programming. Math. Oper. Res. 14, 237\u2013248 (1989)","journal-title":"Math. Oper. Res."},{"key":"1512_CR22","first-page":"383","volume":"4","author":"H Bauschke","year":"2008","unstructured":"Bauschke, H., Combettes, P.: A Dykstra-like algorithm for two monotone operators. Pac. J. Optim. 4, 383\u2013391 (2008)","journal-title":"Pac. J. Optim."},{"key":"1512_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01581245","volume":"59","author":"P Tseng","year":"1993","unstructured":"Tseng, P.: Dual coordinate ascent methods for non-strictly convex minimization. Math. Program. 59, 231\u2013247 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"1512_CR24","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.jmaa.2011.02.079","volume":"380","author":"P Combettes","year":"2011","unstructured":"Combettes, P., D\u0169ng, D., V\u0169, B.: Proximity for sums of composite functions. J. Math. Anal. Appl. 380(2), 680\u2013688 (2011)","journal-title":"J. Math. Anal. Appl."},{"key":"1512_CR25","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s11228-010-0147-7","volume":"18","author":"P Combettes","year":"2010","unstructured":"Combettes, P., D\u0169ng, D., V\u0169, B.: Dualization of signal recovery problems. Set-Valued Var. Anal. 18, 373\u2013404 (2010)","journal-title":"Set-Valued Var. Anal."},{"issue":"3","key":"1512_CR26","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10851-016-0696-y","volume":"59","author":"F Abboud","year":"2017","unstructured":"Abboud, F., Chouzenoux, E., Pesquet, J.C., Chenot, J.H., Laborelli, L.: Dual block-coordinate forward\u2013backward algorithm with application to deconvolution and deinterlacing of video sequences. J. Math. Imaging Vis. 59(3), 415\u2013431 (2017)","journal-title":"J. Math. Imaging Vis."},{"key":"1512_CR27","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-011-0468-9","volume":"225","author":"A Nedi\u0107","year":"2011","unstructured":"Nedi\u0107, A.: Random algorithms for convex minimization problems. Math. Program. Ser. B 225, 225\u2013253 (2011)","journal-title":"Math. Program. Ser. B"},{"key":"1512_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer, London (2004)"},{"issue":"1","key":"1512_CR29","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":"1512_CR30","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization (2008)"},{"key":"1512_CR31","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"H Bauschke","year":"1996","unstructured":"Bauschke, H., Borwein, J.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"1512_CR32","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s10589-011-9401-7","volume":"51","author":"Y Censor","year":"2012","unstructured":"Censor, Y., Chen, W., Combettes, P.L., Davidi, R., Herman, G.: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Comput. Optim. Appl. 51, 1065\u20131088 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1512_CR33","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1137\/070711712","volume":"20","author":"EH Neto","year":"2009","unstructured":"Neto, E.H., Pierro, A.D.: Incremental subgradients for constrained convex optimization: a unified framework and new methods. SIAM J. Optim. 20, 1547\u20131572 (2009)","journal-title":"SIAM J. Optim."},{"key":"1512_CR34","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/080726380","volume":"20","author":"S Ram","year":"2009","unstructured":"Ram, S., Nedi\u0107, A., Veeravalli, V.: Incremental stochastic subgradient algorithms for convex optimization. SIAM J. Optim. 20, 691\u2013717 (2009)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1512_CR35","doi-asserted-by":"publisher","first-page":"065008","DOI":"10.1088\/0266-5611\/26\/6\/065008","volume":"26","author":"Y Censor","year":"2010","unstructured":"Censor, Y., Davidi, R., Herman, G.: Perturbation resilience and superiorization of iterative algorithms. Inverse Probl. 26(6), 065008 (2010)","journal-title":"Inverse Probl."},{"key":"1512_CR36","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1007\/s10957-013-0408-3","volume":"160","author":"Y Censor","year":"2014","unstructured":"Censor, Y., Davidi, R., Herman, G., Schulte, R., Tetruashvili, L.: Projected subgradient minimization versus superiorization. J. Optim. Theory Appl. 160, 730\u2013747 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1512_CR37","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s101070050083","volume":"86","author":"H Bauschke","year":"1999","unstructured":"Bauschke, H., Borwein, J., Li, W.: Strong conical hull intersection property, bounded linear regularity, Jameson\u2019s property (G), and error bounds in convex optimization. Math. Program., Ser. A 86(1), 135\u2013160 (1999)","journal-title":"Math. Program., Ser. A"},{"issue":"2\u20133","key":"1512_CR38","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10107-005-0615-2","volume":"104","author":"J Burke","year":"2005","unstructured":"Burke, J., Deng, S.: Weak sharp minima revisited. II. Application to linear regularity and error bounds. Math. Program., Ser. B 104(2\u20133), 235\u2013261 (2005)","journal-title":"Math. Program., Ser. B"},{"key":"1512_CR39","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10107-003-0464-9","volume":"99","author":"K Ng","year":"2004","unstructured":"Ng, K., Yang, W.: Regularities and their relations to error bounds. Math. Program., Ser. A 99, 521\u2013538 (2004)","journal-title":"Math. Program., Ser. A"},{"key":"1512_CR40","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s11228-006-0014-8","volume":"14","author":"A Kruger","year":"2006","unstructured":"Kruger, A.: About regularity of collections of sets. Set-Valued Anal. 14, 187\u2013206 (2006)","journal-title":"Set-Valued Anal."},{"issue":"1","key":"1512_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","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 (2010)","journal-title":"Found. Trends Mach. Learn."},{"key":"1512_CR42","doi-asserted-by":"crossref","unstructured":"Combettes, P., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Bauschke, H., Burachik, R., Combettes, P., Elser, V., Luke, D., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer, New York, NY (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"1","key":"1512_CR43","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/18M1168297","volume":"29","author":"CHJ Pang","year":"2018","unstructured":"Pang, C.H.J.: Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting. SIAM J. Optim. 29(1), 484\u2013510 (2018)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01512-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T00:22:28Z","timestamp":1585441348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01512-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,30]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1512"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01512-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,30]]},"assertion":[{"value":"20 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}