{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T18:24:21Z","timestamp":1775759061027,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T00:00:00Z","timestamp":1714608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T00:00:00Z","timestamp":1714608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["ZDSYS20211021111415025"],"award-info":[{"award-number":["ZDSYS20211021111415025"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10915-024-02537-x","type":"journal-article","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T05:01:38Z","timestamp":1714626098000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Improved Conditions for Some Primal-Dual Algorithms"],"prefix":"10.1007","volume":"99","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8686-3530","authenticated-orcid":false,"given":"Ming","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,2]]},"reference":[{"issue":"1","key":"2537_CR1","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(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"2537_CR2","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-dual fixed point algorithm for convex separable minimization with applications to image restoration. Inverse Prob. 29(2), 025011 (2013)","journal-title":"Inverse Prob."},{"issue":"1","key":"2537_CR3","doi-asserted-by":"publisher","first-page":"1","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), 1\u201318 (2016)","journal-title":"Fixed Point Theory Appl."},{"issue":"2","key":"2537_CR4","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)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2537_CR5","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-concave saddle-point problems. Oper. Res. Lett. 43(2), 209\u2013214 (2015)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"2537_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10589-019-00152-3","volume":"75","author":"B He","year":"2020","unstructured":"He, B., Ma, F., Yuan, X.: Optimally linearizing the alternating direction method of multipliers for convex programming. Comput. Optim. Appl. 75(2), 361\u2013388 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2537_CR7","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-backward-adjoint splitting for solving monotone inclusions involving three operators. Comput. Optim. Appl. 68(1), 57\u201393 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2537_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10444-020-09840-9","volume":"47","author":"Z Li","year":"2021","unstructured":"Li, Z., Yan, M.: New convergence analysis of a primal-dual algorithm with large stepsizes. Adv. Comput. Math. 47(1), 1\u201320 (2021)","journal-title":"Adv. Comput. Math."},{"issue":"12","key":"2537_CR9","doi-asserted-by":"publisher","first-page":"125007","DOI":"10.1088\/0266-5611\/27\/12\/125007","volume":"27","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 Prob. 27(12), 125007 (2011)","journal-title":"Inverse Prob."},{"key":"2537_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s10915-023-02105-9","volume":"94","author":"Y Ma","year":"2023","unstructured":"Ma, Y., Cai, X., Jiang, B., Han, D.: Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM. J. Sci. Comput. 94, 60 (2023)","journal-title":"J. Sci. Comput."},{"key":"2537_CR11","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., et al.: Lectures on Convex Optimization. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-91578-4"},{"key":"2537_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970524","volume-title":"Conjugate Duality and Optimization","author":"RT Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. SIAM, New Delhi (1974)"},{"issue":"1","key":"2537_CR13","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s10957-022-02061-8","volume":"195","author":"A Salim","year":"2022","unstructured":"Salim, A., Condat, L., Mishchenko, K., Richt\u00e1rik, P.: Dualize, split, randomize: toward fast nonsmooth optimization algorithms. J. Optim. Theory Appl. 195(1), 102\u2013130 (2022)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2537_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc.: Ser. B (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc.: Ser. B (Methodol.)"},{"issue":"1","key":"2537_CR15","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 (Statist. Methodol.) 67(1), 91\u2013108 (2005)","journal-title":"J. R. Stat. Soc.: Ser. B (Statist. Methodol.)"},{"issue":"3","key":"2537_CR16","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"BC Vu","year":"2013","unstructured":"Vu, 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."},{"issue":"3","key":"2537_CR17","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1007\/s10915-018-0680-3","volume":"76","author":"M Yan","year":"2018","unstructured":"Yan, M.: A new primal-dual algorithm for minimizing the sum of three functions with a linear operator. J. Sci. Comput. 76(3), 1698\u20131717 (2018)","journal-title":"J. Sci. Comput."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02537-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02537-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02537-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T14:16:17Z","timestamp":1716473777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02537-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,2]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2537"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02537-x","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,2]]},"assertion":[{"value":"4 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2024","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 have not disclosed any Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"74"}}