{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T22:42:35Z","timestamp":1768430555986,"version":"3.49.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the convergence of a recently popular class of first-order primal\u2013dual algorithms for saddle point problems under the presence of errors in the proximal maps and gradients. We study several types of errors and show that, provided a sufficient decay of these errors, the same convergence rates as for the error-free algorithm can be established. More precisely, we prove the (optimal) <jats:inline-formula><jats:alternatives><jats:tex-math>$$O\\left( 1\/N\\right)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mfenced><mml:mn>1<\/mml:mn><mml:mo>\/<\/mml:mo><mml:mi>N<\/mml:mi><\/mml:mfenced><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula> convergence to a saddle point in finite dimensions for the class of non-smooth problems considered in this paper, and prove a <jats:inline-formula><jats:alternatives><jats:tex-math>$$O\\left( 1\/N^2\\right)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mfenced><mml:mn>1<\/mml:mn><mml:mo>\/<\/mml:mo><mml:msup><mml:mi>N<\/mml:mi><mml:mn>2<\/mml:mn><\/mml:msup><\/mml:mfenced><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula> or even linear <jats:inline-formula><jats:alternatives><jats:tex-math>$$O\\left( \\theta ^N\\right)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mfenced><mml:msup><mml:mi>\u03b8<\/mml:mi><mml:mi>N<\/mml:mi><\/mml:msup><\/mml:mfenced><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula> convergence rate if either the primal or dual objective respectively both are strongly convex. Moreover we show that also under a slower decay of errors we can establish rates, however slower and directly depending on the decay of the errors. We demonstrate the performance and practical use of the algorithms on the example of nested algorithms and show how they can be used to split the global objective more efficiently.<\/jats:p>","DOI":"10.1007\/s10589-020-00186-y","type":"journal-article","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T19:04:02Z","timestamp":1585595042000},"page":"381-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Inexact first-order primal\u2013dual algorithms"],"prefix":"10.1007","volume":"76","author":[{"given":"Julian","family":"Rasch","sequence":"first","affiliation":[]},{"given":"Antonin","family":"Chambolle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"issue":"3","key":"186_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s005260100152","volume":"16","author":"G Alberti","year":"2003","unstructured":"Alberti, G., Bouchitt\u00e9, G., Dal Maso, G.: The calibration method for the Mumford\u2013Shah functional and free-discontinuity problems. Calc. Var. Partial. Differ. Equ. 16(3), 299\u2013333 (2003)","journal-title":"Calc. Var. Partial. Differ. Equ."},{"issue":"6","key":"186_CR2","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/78.139258","volume":"40","author":"S Alliney","year":"1992","unstructured":"Alliney, S.: Digital filters as absolute norm regularizers. IEEE Trans. Signal Process. 40(6), 1548\u20131562 (1992)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"186_CR3","doi-asserted-by":"crossref","first-page":"1346","DOI":"10.1109\/78.506602","volume":"44","author":"S Alliney","year":"1996","unstructured":"Alliney, S.: Recursive median filters of increasing order: a variational approach. IEEE Trans. Signal Process. 44(6), 1346\u20131354 (1996)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"186_CR4","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/78.564179","volume":"45","author":"S Alliney","year":"1997","unstructured":"Alliney, S.: A property of the minimum vectors of a regularizing functional defined by means of the absolute norm. IEEE Trans. Signal Process. 45(4), 913\u2013917 (1997)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"186_CR5","doi-asserted-by":"crossref","first-page":"2408","DOI":"10.1137\/140994964","volume":"25","author":"J-F Aujol","year":"2015","unstructured":"Aujol, J.-F., Dossal, C.: Stability of over-relaxations for the forward\u2013backward algorithm, application to FISTA. SIAM J. Optim. 25(4), 2408\u20132433 (2015)","journal-title":"SIAM J. Optim."},{"key":"186_CR6","unstructured":"Barbero, \u00c1., Sra, S.: Fast Newton-type methods for total variation regularization. In: Proceedings of the 28th International Conference on International Conference on Machine Learning, ICML\u201911, pp. 313\u2013320, USA, 2011. Omnipress (2011)"},{"issue":"11","key":"186_CR7","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 18(11), 2419\u20132434 (2009)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"186_CR8","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","key":"186_CR9","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for nonsmooth optimization. SIAM J. Optim. 26(2), 891\u2013921 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"186_CR10","doi-asserted-by":"crossref","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."},{"issue":"1","key":"186_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00205-017-1192-2","volume":"228","author":"A Brancolini","year":"2018","unstructured":"Brancolini, A., Rossmanith, C., Wirth, B.: Optimal micropatterns in 2D transport networks and their relation to image inpainting. Arch. Ration. Mech. Anal. 228(1), 279\u2013308 (2018)","journal-title":"Arch. Ration. Mech. Anal."},{"issue":"3","key":"186_CR12","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"186_CR13","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1007\/s10851-017-0747-z","volume":"59","author":"E-M Brinkmann","year":"2017","unstructured":"Brinkmann, E.-M., Burger, M., Rasch, J., Sutour, C.: Bias reduction in variational regularization. J. Math. Imaging Vis. 59(3), 534\u2013566 (2017)","journal-title":"J. Math. Imaging Vis."},{"issue":"4","key":"186_CR14","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"186_CR15","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."},{"key":"186_CR16","doi-asserted-by":"crossref","unstructured":"Chambolle, A., Ehrhardt, M.J., Richtarik, P., Sch\u00f6nlieb, C.-B.: Stochastic primal\u2013dual hybrid gradient algorithm with arbitrary sampling and imaging applications. Working paper or preprint, June (2017)","DOI":"10.1137\/17M1134834"},{"key":"186_CR17","doi-asserted-by":"crossref","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\u20132","key":"186_CR18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal\u2013dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"5","key":"186_CR19","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1137\/040604297","volume":"65","author":"TF Chan","year":"2005","unstructured":"Chan, T.F., Esedoglu, S.: Aspects of total variation regularized l1 function approximation. SIAM J. Appl. Math. 65(5), 1817\u20131837 (2005)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"186_CR20","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1137\/080727749","volume":"2","author":"C Chaux","year":"2009","unstructured":"Chaux, C., Pesquet, J.-C., Pustelnik, N.: Nested iterative algorithms for convex constrained image recovery problems. SIAM J. Imaging Sci. 2(2), 730\u2013762 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"5\u20136","key":"186_CR21","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/02331930412331327157","volume":"53","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53(5\u20136), 475\u2013504 (2004)","journal-title":"Optimization"},{"key":"186_CR22","first-page":"185","volume-title":"Proximal Splitting Methods in Signal Processing","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal Splitting Methods in Signal Processing, pp. 185\u2013212. Springer, New York (2011)"},{"issue":"4","key":"186_CR23","doi-asserted-by":"crossref","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\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"3","key":"186_CR24","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1023\/A:1022621905645","volume":"95","author":"R Cominetti","year":"1997","unstructured":"Cominetti, R.: Coupling the proximal point algorithm with approximation methods. J. Optim. Theory Appl. 95(3), 581\u2013600 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"186_CR25","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."},{"issue":"3","key":"186_CR26","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/060676386","volume":"19","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A.: Smooth optimization with approximate gradient. SIAM J. Optim. 19(3), 1171\u20131183 (2008)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"186_CR27","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1), 37\u201375 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"186_CR28","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/090758490","volume":"2","author":"Y Dong","year":"2009","unstructured":"Dong, Y., Hinterm\u00fcller, M., Neri, M.: An efficient primal\u2013dual method for l1-tv image restoration. SIAM J. Imaging Sci. 2(4), 1168\u20131189 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"384","key":"186_CR29","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/01621459.1983.10477029","volume":"78","author":"RL Dykstra","year":"1983","unstructured":"Dykstra, R.L.: An algorithm for restricted least squares regression. J. Am. Stat. Assoc. 78(384), 837\u2013842 (1983)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"186_CR30","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/15M1047325","volume":"9","author":"M Ehrhardt","year":"2016","unstructured":"Ehrhardt, M., Betcke, M.: Multicontrast MRI reconstruction with structure-guided total variation. SIAM J. Imaging Sci. 9(3), 1084\u20131106 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"186_CR31","unstructured":"Esser, E.: Applications of Lagrangian-based alternating direction methods and connections to split Bregman. CAM Rep. 9 (2009)"},{"issue":"4","key":"186_CR32","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":"3","key":"186_CR33","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/TIP.2010.2072512","volume":"20","author":"JM Fadili","year":"2011","unstructured":"Fadili, J.M., Peyre, G.: Total variation projection with first order schemes. IEEE Trans. Image Process. 20(3), 657\u2013669 (2011)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"186_CR34","doi-asserted-by":"crossref","first-page":"A1380","DOI":"10.1137\/110830629","volume":"34","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Schmidt, M.: Hybrid deterministic-stochastic methods for data fitting. SIAM J. Sci. Comput. 34(3), A1380\u2013A1405 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"186_CR35","doi-asserted-by":"crossref","first-page":"1881","DOI":"10.1137\/040615079","volume":"27","author":"F Haoying","year":"2006","unstructured":"Haoying, F., Ng, M.K., Nikolova, M., Barlow, J.L.: Efficient minimization methods of mixed l2\u2013l1 and l1\u2013l1 norms for image restoration. SIAM J. Sci. Comput. 27(6), 1881\u20131902 (2006)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"186_CR36","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1137\/0802032","volume":"2","author":"O G\u00fcler","year":"1992","unstructured":"G\u00fcler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u2013664 (1992)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"186_CR37","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1007\/s10957-011-9948-6","volume":"154","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: An accelerated inexact proximal point algorithm for convex minimization. J. Optim. Theory Appl. 154(2), 536\u2013548 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"186_CR38","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00607-004-0097-8","volume":"74","author":"T K\u00e4rkk\u00e4inen","year":"2005","unstructured":"K\u00e4rkk\u00e4inen, T., Kunisch, K., Majava, K.: Denoising of smooth images using l1-fitting. Computing 74(4), 353\u2013376 (2005)","journal-title":"Computing"},{"key":"186_CR39","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-642-51682-5_4","volume-title":"Advances in Optimization","author":"B Lemaire","year":"1992","unstructured":"Lemaire, B.: About the convergence of the proximal method. In: Oettli, W., Pallaschke, D. (eds.) Advances in Optimization, pp. 39\u201351. Springer, Berlin (1992)"},{"issue":"1","key":"186_CR40","first-page":"7854","volume":"18","author":"H Lin","year":"2017","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: Catalyst acceleration for first-order convex optimization: from theory to practice. J. Mach. Learn. Res. 18(1), 7854\u20137907 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"186_CR41","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. In: Advances in Neural Information Processing Systems, pp. 3384\u20133392 (2015)"},{"issue":"6","key":"186_CR42","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"186_CR43","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"186_CR44","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128(1), 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"186_CR45","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: Br\u00e8ve communication r\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. ESAIM Math. Model. Numer. Anal. 4(3), 154\u2013158 (1970)","journal-title":"ESAIM Math. Model. Numer. Anal."},{"key":"186_CR46","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. Fr. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. Fr."},{"key":"186_CR47","first-page":"223","volume-title":"Convergence Rate of Incremental Subgradient Algorithms","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.: Convergence Rate of Incremental Subgradient Algorithms, pp. 223\u2013264. Springer, Boston (2001)"},{"issue":"1","key":"186_CR48","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)$$ 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":"186_CR49","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2014","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, 1st edn. Springer, Berlin (2014)","edition":"1"},{"issue":"3","key":"186_CR50","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1137\/S0036142901389165","volume":"40","author":"M Nikolova","year":"2002","unstructured":"Nikolova, M.: Minimizers of cost-functions involving nonsmooth data-fidelity terms. Application to the processing of outliers. SIAM J. Numer. Anal. 40(3), 965\u2013994 (2002)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"186_CR51","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/B:JMIV.0000011920.58935.9c","volume":"20","author":"M Nikolova","year":"2004","unstructured":"Nikolova, M.: A variational approach to remove outliers and impulse noise. J. Math. Imaging Vis. 20(1), 99\u2013120 (2004)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"186_CR52","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1137\/040605412","volume":"4","author":"S Osher","year":"2005","unstructured":"Osher, S., Burger, M., Goldfarb, D., Jinjun, X., Yin, W.: An iterative regularization method for total variation-based image restoration. Multiscale Model. Simul. 4(2), 460\u2013489 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"186_CR53","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/S105262349427577X","volume":"8","author":"M Patriksson","year":"1997","unstructured":"Patriksson, M.: Cost approximation: a unified framework of descent algorithms for nonlinear programs. SIAM J. Optim. 8, 561\u2013582 (1997)","journal-title":"SIAM J. Optim."},{"key":"186_CR54","doi-asserted-by":"crossref","unstructured":"Pock, T., Cremers, D., Bischof, H., Chambolle, A.: An algorithm for minimizing the Mumford\u2013Shah functional. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 1133\u20131140, Sept (2009)","DOI":"10.1109\/ICCV.2009.5459348"},{"issue":"2","key":"186_CR55","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"186_CR56","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."},{"key":"186_CR57","volume-title":"Convex Analysis. Princeton Landmarks in Mathematics and Physics","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics and Physics. Princeton University Press, Princeton (1970)"},{"issue":"4","key":"186_CR58","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"key":"186_CR59","first-page":"1","volume-title":"Level Set and PDE Based Reconstruction Methods in Imaging. Lecture Notes in Mathematics","author":"A Sawatzky","year":"2013","unstructured":"Sawatzky, A., Brune, C., Koesters, T., W\u00fcbbeling, F., Burger, M.: EM-TV methods for inverse problems with Poisson noise. In: Burger, M., Mennucci, A.C., Osher, S., Rumpf, M. (eds.) Level Set and PDE Based Reconstruction Methods in Imaging. Lecture Notes in Mathematics, vol. 2090, pp. 1\u201370. Springer, Berlin (2013)"},{"key":"186_CR60","first-page":"1458","volume-title":"Advances in Neural Information Processing Systems","author":"M Schmidt","year":"2011","unstructured":"Schmidt, M., Roux, N.L., Bach, F.R.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Shawe-Taylor, J., Zemel, R.S., Bartlett, P.L., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 24, pp. 1458\u20131466. Curran Associates Inc, Red Hook (2011)"},{"issue":"3","key":"186_CR61","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"186_CR62","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10915-011-9477-3","volume":"50","author":"C Wu","year":"2012","unstructured":"Wu, C., Zhang, J., Duan, Y., Tai, X.-C.: Augmented Lagrangian method for total variation based image restoration and segmentation over triangulated surfaces. J. Sci. Comput. 50(1), 145\u2013166 (2012)","journal-title":"J. Sci. Comput."},{"key":"186_CR63","doi-asserted-by":"crossref","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Zalinescu","year":"2002","unstructured":"Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)"},{"issue":"5","key":"186_CR64","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1137\/090766930","volume":"20","author":"AJ Zaslavski","year":"2010","unstructured":"Zaslavski, A.J.: Convergence of a proximal point method in the presence of computational errors in Hilbert spaces. SIAM J. Optim. 20(5), 2413\u20132421 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00186-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00186-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00186-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T23:39:25Z","timestamp":1617061165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00186-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00186-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"12 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}