{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:15:40Z","timestamp":1780344940445,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T00:00:00Z","timestamp":1446163200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-12-IS01-0003"],"award-info":[{"award-number":["ANR-12-IS01-0003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I1148"],"award-info":[{"award-number":["I1148"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10107-015-0957-3","type":"journal-article","created":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T05:27:43Z","timestamp":1446182863000},"page":"253-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":292,"title":["On the ergodic convergence rates of a first-order primal\u2013dual algorithm"],"prefix":"10.1007","volume":"159","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9465-4659","authenticated-orcid":false,"given":"Antonin","family":"Chambolle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Pock","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,30]]},"reference":[{"key":"957_CR1","doi-asserted-by":"crossref","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(1\u20132), 3\u201311 (2001)","DOI":"10.1023\/A:1011253113155"},{"issue":"3","key":"957_CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"957_CR3","doi-asserted-by":"crossref","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":"2, Ser. A","key":"957_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-014-0766-0","volume":"150","author":"RI Bo\u0163","year":"2015","unstructured":"Bo\u0163, R.I., Csetnek, E.R., Heinrich, A., Hendrich, C.: On the convergence rate improvement of a primal\u2013dual splitting algorithm for solving monotone inclusion problems. Math. Program. 150(2, Ser. A), 251\u2013279 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"957_CR5","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal\u2013dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"3","key":"957_CR6","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"957_CR7","doi-asserted-by":"crossref","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Yunmei Chen","year":"2014","unstructured":"Chen, Yunmei, Lan, Guanghui, Ouyang, Yuyuan: Optimal primal\u2013dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"957_CR8","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Condat, L., Pesquet, J.-C., V\u0169, B.C.: A forward\u2013backward view of some primal\u2013dual optimization methods in image recovery. In: Proceedings ICIP 2014 Conference, Paris, Oct.\u00a02014 (2014) (to appear)","DOI":"10.1109\/ICIP.2014.7025841"},{"issue":"2","key":"957_CR9","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal\u2013dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158(2), 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"957_CR10","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Technical report, CAM Report 15-13\/preprint arXiv:1504.01032 (2015)"},{"issue":"2","key":"957_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.orl.2015.02.001","volume":"43","author":"Y Drori","year":"2015","unstructured":"Drori, Y., Sabach, S., Teboulle, M.: A simple algorithm for a class of nonsmooth convex\u2013concave saddle-point problems. Oper. Res. Lett. 43(2), 209\u2013214 (2015)","journal-title":"Oper. Res. Lett."},{"key":"957_CR12","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the $$\\ell _1$$ \u2113 1 -ball for learning in high dimensions. In: Proceedings of the 25th international conference on machine learning, ICML \u201908, pages 272\u2013279, New York (2008). ACM","DOI":"10.1145\/1390156.1390191"},{"issue":"1","key":"957_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J Eckstein","year":"1993","unstructured":"Eckstein, J.: Nonlinear proximal point algorithms using bregman functions, with applications to convex programming. Math. Oper. Res. 18(1), 202\u2013226 (1993)","journal-title":"Math. Oper. Res."},{"issue":"3, Ser. A","key":"957_CR14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(3, Ser. A), 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"957_CR15","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.F.: A general framework for a class of first order primal\u2013dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"957_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: Convergence analysis of primal\u2013dual algorithms for a saddle-point problem: from contraction perspective. SIAM J. Imaging Sci. 5(1), 119\u2013149 (2012)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"957_CR17","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $$O(1\/n)$$ O ( 1 \/ n ) convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"957_CR18","unstructured":"Hohage, T., Homann, C.: A generalization of the Chambolle\u2013Pock algorithm to Banach spaces with applications to inverse problems. Technical report, arXiv:1412.0126 (2014)"},{"issue":"2","key":"957_CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10851-014-0523-2","volume":"51","author":"DA Lorenz","year":"2015","unstructured":"Lorenz, D.A., Pock, T.: An inertial forward\u2013backward algorithm for monotone inclusions. J. Math. Imaging Vis. 51(2), 311\u2013325 (2015)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"957_CR20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"AS Nemirovski","year":"2004","unstructured":"Nemirovski, A.S.: Prox-method with rate of convergence $$O(1\/t)$$ O ( 1 \/ t ) for variational inequalities with Lipschitz continuous monotone operators and smooth convex\u2013concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004). (electronic)","journal-title":"SIAM J. Optim."},{"key":"957_CR21","unstructured":"Nemirovski, A.S., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983). Translated from the Russian and with a preface by E.R. Dawson, Wiley-Interscience Series in Discrete Mathematics"},{"key":"957_CR22","series-title":"Applied Optimization","doi-asserted-by":"crossref","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. Applied Optimization, vol. 87. Kluwer Academic Publishers, Boston (2004). A basic course"},{"issue":"1","key":"957_CR23","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"957_CR24","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z Opial","year":"1967","unstructured":"Opial, Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73, 591\u2013597 (1967)","journal-title":"Bull. Am. Math. Soc."},{"key":"957_CR25","unstructured":"Pesquet, J.-C., Repetti, A.: A class of randomized primal\u2013dual algorithms for distributed optimization. arXiv:1406.6404 (2014)"},{"key":"957_CR26","doi-asserted-by":"crossref","unstructured":"Pock, T., Cremers, D., Bischof, H., Chambolle, A.: An algorithm for minimizing the Mumford-Shah functional. In: ICCV Proceedings, LNCS. Springer (2009)","DOI":"10.1109\/ICCV.2009.5459348"},{"issue":"5","key":"957_CR27","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"957_CR28","doi-asserted-by":"crossref","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":"3","key":"957_CR29","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/moor.17.3.670","volume":"17","author":"M Teboulle","year":"1992","unstructured":"Teboulle, M.: Entropic proximal mappings with applications to nonlinear programming. Math. Oper. Res. 17(3), 670\u2013690 (1992)","journal-title":"Math. Oper. Res."},{"key":"957_CR30","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex\u2013concave optimization (2008). SIAM J. Optim. http:\/\/www.csie.ntu.edu.tw\/~b97058\/tseng\/papers\/apgm . (submitted)"},{"issue":"3","key":"957_CR31","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"BC V\u0169","year":"2013","unstructured":"V\u0169, B.C.: A splitting algorithm for dual monotone inclusions involving cocoercive operators. Adv. Comput. Math. 38(3), 667\u2013681 (2013)","journal-title":"Adv. Comput. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0957-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0957-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0957-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:08Z","timestamp":1559109608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0957-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,30]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["957"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0957-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,30]]}}}