{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:48:45Z","timestamp":1775256525919,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T00:00:00Z","timestamp":1540339200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008367","name":"Universit\u00e9 Libre de Bruxelles","doi-asserted-by":"publisher","award":["ARC grant"],"award-info":[{"award-number":["ARC grant"]}],"id":[{"id":"10.13039\/501100008367","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002860","name":"China Sponsorship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002860","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11075-018-0616-x","type":"journal-article","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T07:08:15Z","timestamp":1540364895000},"page":"605-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On starting and stopping criteria for nested primal-dual iterations"],"prefix":"10.1007","volume":"82","author":[{"given":"Jixin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8737-5117","authenticated-orcid":false,"given":"Ignace","family":"Loris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"616_CR1","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bull. Am. Math. Soc. 70, 709\u2013710 (1964)","journal-title":"Bull. Am. Math. Soc."},{"issue":"4","key":"616_CR2","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). https:\/\/doi.org\/10.1137\/050626090","journal-title":"Multiscale Model. Simul."},{"key":"616_CR3","doi-asserted-by":"publisher","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. France 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. France"},{"issue":"9","key":"616_CR4","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1080\/02331934.2012.733883","volume":"63","author":"PL Combettes","year":"2014","unstructured":"Combettes, P.L., V\u0169, B.C.: Variable metric forward-backward splitting with applications to monotone inclusions in duality. Optimization 63(9), 1289\u20131318 (2014). https:\/\/doi.org\/10.1080\/02331934.2012.733883","journal-title":"Optimization"},{"issue":"1","key":"616_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-013-0465-7","volume":"162","author":"E Chouzenoux","year":"2014","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function. J. Optim. Theory Appl. 162(1), 107\u2013132 (2014). https:\/\/doi.org\/10.1007\/s10957-013-0465-7","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"616_CR6","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158 (2), 460\u2013479 (2013). https:\/\/doi.org\/10.1007\/s10957-012-0245-9","journal-title":"J. Optim. Theory Appl."},{"key":"616_CR7","doi-asserted-by":"publisher","unstructured":"Combettes, P.L., Condat, L., Pesquet, J.C., Vu, B.C.: A Forward-Backward View of Some Primal-Dual Optimization Methods in Image Recovery. In: 2014 IEEE International Conference on Image Processing (ICIP), pp 4141\u20134145 (2014), https:\/\/doi.org\/10.1109\/ICIP.2014.7025841","DOI":"10.1109\/ICIP.2014.7025841"},{"key":"616_CR8","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 Numerica 25, 161\u2013319 (2016). https:\/\/doi.org\/10.1017\/S096249291600009X","journal-title":"Acta Numerica"},{"issue":"1","key":"616_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., Knight, K.: Sparsity and smoothness via the fused lasso. J. R. Stat. Soc., Ser. B, Stat. Methodol. 67(1), 91\u2013108 (2005). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00490.x >","journal-title":"J. R. Stat. Soc., Ser. B, Stat. Methodol."},{"issue":"1","key":"616_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc., Ser. B, Stat. Methodol. 68(1), 49\u201367 (2006). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00532.x","journal-title":"J. R. Stat. Soc., Ser. B, Stat. Methodol."},{"key":"616_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10915-010-9408-8","volume":"46","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Burger, M., Osher, S.: A unified primal-dual algorithm framework based on bregman iteration. J Sci Comput 46, 20\u201346 (2011). https:\/\/doi.org\/10.1007\/s10915-010-9408-8","journal-title":"J Sci Comput"},{"issue":"2","key":"616_CR12","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11228-011-0191-y","volume":"20","author":"PL Combettes","year":"2012","unstructured":"Combettes, P.L., Pesquet, J.C.: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, lipschitzian, and parallel-sum type monotone operators. Set-Valued and Variational Analysis 20(2), 307\u2013330 (2012). https:\/\/doi.org\/10.1007\/s11228-011-0191-y","journal-title":"Set-Valued and Variational Analysis"},{"issue":"1","key":"616_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1186\/s13663-016-0543-2","volume":"2016","author":"P Chen","year":"2016","unstructured":"Chen, P., Huang, J., Zhang, X.: A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions. Fixed Point Theory appl. 2016(1), 54 (2016). https:\/\/doi.org\/10.1186\/s13663-016-0543-2","journal-title":"Fixed Point Theory appl."},{"issue":"1","key":"616_CR14","doi-asserted-by":"publisher","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), 253\u2013287 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0957-3","journal-title":"Math. Program."},{"issue":"3","key":"616_CR15","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10444-011-9254-8","journal-title":"Adv. Comput. Math."},{"issue":"2","key":"616_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-014-0766-0","volume":"150","author":"RI Bo\u0162","year":"2015","unstructured":"Bo\u0162, R.I., Csetnek, E.R., Heinrich, A., Hendrich, C.: On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems. Math. Program. 150(2), 251\u2013279 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0766-0","journal-title":"Math. Program."},{"key":"616_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:JMIV.0000011325.36760.1e","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J Math Imaging and Vision 20, 89\u201397 (2004). https:\/\/doi.org\/10.1023\/B:JMIV.0000011325.36760.1e","journal-title":"J Math Imaging and Vision"},{"key":"616_CR18","doi-asserted-by":"publisher","unstructured":"Chambolle, A.: Total variation minimization and a class of binary mrf models. In: Energy Minimization Methods in Computer Vision and Pattern Recognition, Lecture Notes in Computer Science, vol. 3757, pp 136\u2013152. https:\/\/doi.org\/10.1007\/11585978_10 (2005)","DOI":"10.1007\/11585978_10"},{"key":"616_CR19","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10851-009-0149-y","volume":"34","author":"JF Aujol","year":"2009","unstructured":"Aujol, J.F.: Some first-order algorithms for total variation based image restoration. J. Math. Imaging. Vis 34, 307\u2013327 (2009). https:\/\/doi.org\/10.1007\/s10851-009-0149-y","journal-title":"J. Math. Imaging. Vis"},{"issue":"11","key":"616_CR20","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/TIP.2009.2028250","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"616_CR21","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/15M1019325","journal-title":"Siam J. Optim."},{"issue":"5","key":"616_CR22","doi-asserted-by":"publisher","first-page":"055,005","DOI":"10.1088\/1361-6420\/aa5bfd","volume":"33","author":"S Bonettini","year":"2017","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M., Rebegoldi, S.: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization. Inverse Problems 33(5), 055,005 (2017). https:\/\/doi.org\/10.1088\/1361-6420\/aa5bfd","journal-title":"Inverse Problems"},{"issue":"4","key":"616_CR23","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":"616_CR24","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Proceedings of the 24th International Conference on Neural Information Processing Systems, NIPS\u201911, Curran Associates Inc., USA, pp 1458\u20131466 (2011)"},{"key":"616_CR25","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-41589-5_13","volume-title":"Splitting methods in communication, imaging, science, and engineering, chap. ADMM algorithmic regularization paths for sparse statistical machine learning","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Chi, E.C., Allen, G.I.: Splitting methods in communication, imaging, science, and engineering, chap. ADMM algorithmic regularization paths for sparse statistical machine learning, pp 433\u2013460. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-319-41589-5"},{"issue":"5","key":"616_CR26","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1118\/1.4914148","volume":"42","author":"S Rose","year":"2015","unstructured":"Rose, S., Andersen, M., Sidky, E., Pan, X.: Noise properties of CT images reconstructed by use of constrained total-variation, data-discrepancy minimization. Med. Phys. 42(5), 2690\u20132698 (2015). https:\/\/doi.org\/10.1118\/1.4914148","journal-title":"Med. Phys."},{"key":"616_CR27","doi-asserted-by":"crossref","unstructured":"Rose, S., Andersen, M.S., Sidky, E.Y., Pan, X.: Technical note: Proximal ordered subsets algorithms for TV constrained optimization in CT image reconstruction. Tech. rep., The University of Chicago, arXiv: http:\/\/arXiv.org\/abs\/1603.08889v1 (2016)","DOI":"10.1109\/NSSMIC.2015.7582108"},{"issue":"12","key":"616_CR28","doi-asserted-by":"publisher","first-page":"007","DOI":"10.1088\/0266-5611\/27\/12\/125007","volume":"125","author":"I Loris","year":"2011","unstructured":"Loris, I., Verhoeven, C.: On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty. Inverse Problems 125(12), 007 (2011). https:\/\/doi.org\/10.1088\/0266-5611\/27\/12\/125007","journal-title":"Inverse Problems"},{"issue":"2","key":"616_CR29","doi-asserted-by":"publisher","first-page":"025,011","DOI":"10.1088\/0266-5611\/29\/2\/025011","volume":"29","author":"P Chen","year":"2013","unstructured":"Chen, P., Huang, J., Zhang, X.: A primal-dual fixed point algorithm for convex separable minimization with applications to image restoration. Inverse Problems 29(2), 025,011 (2013). https:\/\/doi.org\/10.1088\/0266-5611\/29\/2\/025011","journal-title":"Inverse Problems"},{"issue":"2","key":"616_CR30","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/j.orl.2015.02.001","journal-title":"Oper. Res. Lett."},{"key":"616_CR31","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. CMS book in mathematics. Springer, Berlin (2011)","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"616_CR32","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton University Press, Princeton (1970)"},{"issue":"8","key":"616_CR33","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/LSP.2014.2322123","volume":"21","author":"L Condat","year":"2014","unstructured":"Condat, L.: A generic proximal algorithm for convex optimization \u2013 application to total variation minimization. IEEE Signal Proc. Lett. 21(8), 1054\u20131057 (2014). https:\/\/doi.org\/10.1109\/LSP.2014.2322123","journal-title":"IEEE Signal Proc. Lett."},{"key":"616_CR34","doi-asserted-by":"publisher","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-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40, 120\u2013145 (2011). https:\/\/doi.org\/10.1007\/s10851-010-0251-1","journal-title":"J. Math. Imaging Vis."},{"key":"616_CR35","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., Lemarechal, C.: Convex analysis and minimization algorithms. Springer, Berlin (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"issue":"2","key":"616_CR36","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/080727749","journal-title":"SIAM J. Imaging Sci."},{"key":"616_CR37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First order methods in optimization. MOS-SIAM series on optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First order methods in optimization. MOS-SIAM series on optimization. SIAM, Philadelphia (2017)"},{"issue":"1","key":"616_CR38","doi-asserted-by":"publisher","first-page":"002","DOI":"10.1088\/0266-5611\/25\/1\/015002","volume":"015","author":"S Bonettini","year":"2009","unstructured":"Bonettini, S., Zanella, R., Zanni, L.: A scaled gradient projection method for constrained image deblurring. Inverse Problems 015(1), 002 (2009). https:\/\/doi.org\/10.1088\/0266-5611\/25\/1\/015002","journal-title":"Inverse Problems"},{"key":"616_CR39","first-page":"372","volume":"27","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving a convex programming problem with convergence rate O ( 1 \/ k 2 ) $\\mathcal {O}(1\/k^{2})$ . Soviet Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Dokl."},{"key":"616_CR40","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-threshold algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"616_CR41","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the fast iterative shrinkage\/thresholding algorithm. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015). https:\/\/doi.org\/10.1007\/s10957-015-0746-4","journal-title":"J. Optim. Theory Appl."},{"key":"616_CR42","unstructured":"Chen, J.: Domain decomposition methods and convex optimization with applications to inverse problems. Ph.D. thesis, East China Normal University and Universit\u00e9 libre de Bruxelles (2018)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0616-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0616-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0616-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:26:33Z","timestamp":1775251593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0616-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,24]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0616-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,24]]},"assertion":[{"value":"15 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}