{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T21:13:06Z","timestamp":1770757986540,"version":"3.50.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T00:00:00Z","timestamp":1769644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T00:00:00Z","timestamp":1769644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s12190-025-02757-w","type":"journal-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T14:41:59Z","timestamp":1769697719000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On relaxation of the Condat-V\u0169 algorithm for convex-concave saddle point problems"],"prefix":"10.1007","volume":"72","author":[{"given":"Weining","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1807-744X","authenticated-orcid":false,"given":"Shan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shibei","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,29]]},"reference":[{"key":"2757_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.amc.2018.03.089","volume":"333","author":"Y. Yu","year":"2018","unstructured":"Yu, Y., Peng, J.: A modified primal-dual method with applications to some sparse recovery problems. Appl. Math. Comp. 333, 76\u201394 (2018)","journal-title":"Appl. Math. Comp."},{"key":"2757_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/b20190","volume-title":"Handbook of Robust Low-Rank and Sparse Matrix Decomposition: applications in Image and Video Processing","author":"T. Bouwmans","year":"2016","unstructured":"Bouwmans, T., Aybat, N.S., Zahzah, E.-H.: Handbook of Robust Low-Rank and Sparse Matrix Decomposition: applications in Image and Video Processing. CRC Press, New York (2016)"},{"issue":"1","key":"2757_CR3","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)","journal-title":"Fixed Point Theory Appl."},{"issue":"2","key":"2757_CR4","doi-asserted-by":"publisher","first-page":"025011","DOI":"10.1088\/0266-5611\/29\/2\/025011","volume":"29","author":"P. Chen","year":"2013","unstructured":"Chen, P., Huang, J., Zhang, X.: A primal\u2013dual fixed point algorithm for convex separable minimization with applications to image restoration. Inverse Probl. 29(2), 025011 (2013)","journal-title":"Inverse Probl."},{"issue":"11","key":"2757_CR5","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/LSP.2013.2278339","volume":"20","author":"L. Condat","year":"2013","unstructured":"Condat, L.: A direct algorithm for 1-D total variation denoising. IEEE Signal Process. Lett. 20(11), 1054\u20131057 (2013)","journal-title":"IEEE Signal Process. Lett."},{"issue":"7","key":"2757_CR6","doi-asserted-by":"publisher","first-page":"4315","DOI":"10.1007\/s10994-024-06537-8","volume":"113","author":"K. Tang","year":"2024","unstructured":"Tang, K., Liu, W., Mao, X.: Multi-consensus decentralized primal-dual fixed point algorithm for distributed learning. Mach. Learn. 113(7), 4315\u20134357 (2024)","journal-title":"Mach. Learn."},{"issue":"2\u20133","key":"2757_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1561\/0600000058","volume":"8","author":"J. Mairal","year":"2014","unstructured":"Mairal, J., Bach, F., Ponce, J., et al.: Sparse modeling for image and vision processing. Found. Trends[Trademark] Comput. Graphic. Vis. 8(2\u20133), 85\u2013283 (2014)","journal-title":"Found. Trends[Trademark] Comput. Graphics Vision"},{"issue":"2","key":"2757_CR8","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\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":"2757_CR9","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"B.C. 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."},{"key":"2757_CR10","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Condat, L., Pesquet, J.-C., V\u0169, B.:.: A forward-backward view of some primal\u2013dual optimization methods in image recovery. In: 2014 IEEE International Conference on Image Processing (ICIP), pp. 4141\u20134145. (2014). IEEE","DOI":"10.1109\/ICIP.2014.7025841"},{"issue":"1","key":"2757_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-018-1321-1","volume":"179","author":"D. O\u2019Connor","year":"2020","unstructured":"O\u2019Connor, D., Vandenberghe, L.: On the equivalence of the primal-dual hybrid gradient method and Douglas\u2013Rachford splitting. Math. Program. 179(1), 85\u2013108 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"2757_CR12","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1007\/s10957-022-02125-9","volume":"196","author":"X. Jiang","year":"2023","unstructured":"Jiang, X., Vandenberghe, L.: Bregman three-operator splitting methods. J. Optim. Theory Appl. 196(3), 936\u2013972 (2023)","journal-title":"J. Optim. Theory Appl."},{"key":"2757_CR13","volume-title":"Augmented Lagrangian Methods: applications to the Numerical Solution of Boundary-Value Problems","author":"M. Fortin","year":"2000","unstructured":"Fortin, M., Glowinski, R.: Augmented Lagrangian Methods: applications to the Numerical Solution of Boundary-Value Problems, vol. 15. Elsevier, North-Holland (2000)"},{"issue":"1","key":"2757_CR14","first-page":"1","volume":"3","author":"S. Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends[Trademark] Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found Trends[Trademark] Mach. Learn."},{"key":"2757_CR15","unstructured":"Zhu, M., Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. UCLA Cam Report. 34(2) (2008)"},{"issue":"4","key":"2757_CR16","doi-asserted-by":"publisher","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-dual algorithms for convex optimization in imaging science. SIAM J. Imag. Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imag. Sci."},{"key":"2757_CR17","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A.: Diagonal preconditioning for first order primal-dual algorithms in convex optimization. In: 2011 International Conference on Computer Vision, pp. 1762\u20131769. IEEE (2011)","DOI":"10.1109\/ICCV.2011.6126441"},{"issue":"1","key":"2757_CR18","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. Imag. Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imag. Vision"},{"issue":"1","key":"2757_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"B. He","year":"2012","unstructured":"He, B., Yuan, X.: Convergence analysis of primal-dual algorithms for a saddlepoint problem: from contraction perspective. SIAM J. Imag. Sci. 5(1), 119\u2013149 (2012)","journal-title":"SIAM J. Imag. Sci."},{"key":"2757_CR20","doi-asserted-by":"crossref","unstructured":"Ma, F., Li, S., Zhang, X.: A symmetric version of the generalized Chambolle- Pock-He-Yuan method for saddle point problems. Comput. Optim. Appl. 1\u201326 (2025)","DOI":"10.1007\/s10589-025-00671-2"},{"key":"2757_CR21","first-page":"86","volume-title":"Point-To-Set Maps and Mathematical Programming","author":"E.G. Gol\u2019shtein","year":"2009","unstructured":"Gol\u2019shtein, E.G., Tret\u2019yakov, N.: Modified Lagrangians in convex programming and their generalizations. In: Point-To-Set Maps and Mathematical Programming, pp. 86\u201397. Springer, Berlin, Heidelberg (2009)"},{"key":"2757_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10851-017-0709-5","volume":"58","author":"B. He","year":"2017","unstructured":"He, B., Ma, F., Yuan, X.: An algorithmic framework of generalized primal\u2013dual hybrid gradient methods for saddle point problems. J. Math. Imag. Vis. 58, 279\u2013293 (2017)","journal-title":"J. Math. Imag. Vision"},{"issue":"3","key":"2757_CR23","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1137\/21M1453463","volume":"15","author":"B. He","year":"2022","unstructured":"He, B., Ma, F., Xu, S., Yuan, X.: A generalized primal-dual algorithm with improved convergence condition for saddle point problems. SIAM J. Imag. Sci. 15(3), 1157\u20131183 (2022)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"2757_CR24","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s40305-015-0108-9","volume":"3","author":"B.-S. He","year":"2015","unstructured":"He, B.-S.: PPA-like contraction methods for convex optimization: a framework using variational inequality approach. J. Oper. Res. Soc. China 3(4), 391\u2013420 (2015)","journal-title":"J. Operations Res. Soc. China"},{"issue":"3","key":"2757_CR25","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s10589-019-00091-z","volume":"73","author":"F. Ma","year":"2019","unstructured":"Ma, F.: On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective. Comput. Optim. Appl. 73(3), 871\u2013901 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2757_CR26","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)","journal-title":"Acta Numerica"},{"key":"2757_CR27","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. Fixed-Point Algoritms Inverse Probl. Sci. Eng. 185\u2013212 (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"6","key":"2757_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MSP.2014.2377273","volume":"32","author":"N. Komodakis","year":"2015","unstructured":"Komodakis, N., Pesquet, J.-C.: Playing with duality: an overview of recent primal\u2013dual approaches for solving large-scale optimization problems. IEEE Signal Process. Mag. 32(6), 31\u201354 (2015)","journal-title":"IEEE Signal Process. Mag."},{"issue":"4","key":"2757_CR29","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D. Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25(4), 829\u2013858 (2017)","journal-title":"Set-Valued Var. Anal."},{"issue":"1","key":"2757_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10589-017-9909-6","volume":"68","author":"P. Latafat","year":"2017","unstructured":"Latafat, P., Patrinos, P.: Asymmetric forward\u2013backward\u2013adjoint splitting for solving monotone inclusions involving three operators. Comput. Optim. Appl. 68(1), 57\u201393 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2757_CR31","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10851-014-0523-2","volume":"51","author":"D.A. Lorenz","year":"2015","unstructured":"Lorenz, D.A., Pock, T.: An inertial forward-backward algorithm for monotone inclusions. J. Math. Imag. Vision 51(2), 311\u2013325 (2015)","journal-title":"J. Math. Imag. Vision"},{"issue":"3","key":"2757_CR32","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10915-025-02802-7","volume":"102","author":"J. Bai","year":"2025","unstructured":"Bai, J., Chen, Y., Yu, X., Zhang, H.: Generalized asymmetric forward\u2013backward\u2013 adjoint algorithms for convex\u2013concave saddle-point problem. J. Sci. Comput. 102(3), 80 (2025)","journal-title":"J. Sci. Comput."},{"issue":"6","key":"2757_CR33","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1007\/s11590-021-01832-y","volume":"16","author":"F. Jiang","year":"2022","unstructured":"Jiang, F., Wu, Z., Cai, X., Zhang, H.: Unified linear convergence of first-order primal-dual algorithms for saddle point problems. Optim. Lett. 16(6), 1675\u20131700 (2022)","journal-title":"Optim. Lett."},{"issue":"3","key":"2757_CR34","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10589-018-9994-1","volume":"70","author":"B. He","year":"2018","unstructured":"He, B., Yuan, X.: A class of ADMM-based algorithms for three-block separable convex programming. Comput. Optim. Appl. 70(3), 791\u2013826 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2757_CR35","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\u2013 dual algorithm. Math. Program. 159(1), 253\u2013287 (2016)","journal-title":"Math. Program."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02757-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02757-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02757-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:13:09Z","timestamp":1770739989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02757-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,29]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["2757"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02757-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,29]]},"assertion":[{"value":"6 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2026","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 authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"105"}}