{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T01:47:45Z","timestamp":1782092865266,"version":"3.54.5"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T00:00:00Z","timestamp":1778112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T00:00:00Z","timestamp":1778112000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471300"],"award-info":[{"award-number":["12471300"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61977065"],"award-info":[{"award-number":["61977065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"Program of China Scholarship Council","doi-asserted-by":"crossref","award":["202406110004"],"award-info":[{"award-number":["202406110004"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10915-026-03258-z","type":"journal-article","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T10:08:25Z","timestamp":1778148505000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonlinear Preconditioned Primal-Dual Method with Projection for Nonconvex-Nonconcave Minimax Problems"],"prefix":"10.1007","volume":"107","author":[{"given":"Lu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Xue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongxia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8728-7168","authenticated-orcid":false,"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"issue":"1","key":"3258_CR1","first-page":"27","volume":"4","author":"HH Bauschke","year":"1997","unstructured":"Bauschke, H.H., Borwein, J.M., et al.: Legendre functions and the method of random Bregman projections. J. Convex Anal. 4(1), 27\u201367 (1997)","journal-title":"J. Convex Anal."},{"key":"3258_CR2","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics. Springer, 2 edition, (2017)","DOI":"10.1007\/978-3-319-48311-5"},{"key":"3258_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-020-01500-6","volume":"189","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Moursi, W.M., Wang, X.: Generalized monotone operators and their averaged resolvents. Math. Program. 189, 55\u201374 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"3258_CR4","first-page":"161","volume":"12","author":"JM Borwein","year":"2011","unstructured":"Borwein, J.M., Reich, S., Sabach, S.: A characterization of Bregman firmly nonexpansive operators using a new monotonicity concept. J. Nonlinear Convex Anal 12(1), 161\u2013184 (2011)","journal-title":"J. Nonlinear Convex Anal"},{"issue":"3","key":"3258_CR5","doi-asserted-by":"publisher","first-page":"2376","DOI":"10.1137\/21M1448112","volume":"32","author":"K Bredies","year":"2022","unstructured":"Bredies, K., Chenchene, E., Lorenz, D.A., Naldi, E.: Degenerate preconditioned proximal point algorithms. SIAM J. Optim. 32(3), 2376\u20132401 (2022)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3258_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/140965028","volume":"53","author":"K Bredies","year":"2015","unstructured":"Bredies, K., Sun, H.: Preconditioned Douglas-Rachford splitting methods for convex-concave saddle-point problems. SIAM J. Numer. Anal. 53(1), 421\u2013444 (2015)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"3258_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2020.124315","volume":"491","author":"MN B\u00f9i","year":"2020","unstructured":"B\u00f9i, M.N., Combettes, P.L.: Warped proximal iterations for monotone inclusions. J. Math. Anal. Appl. 491(1), 124315 (2020)","journal-title":"J. Math. Anal. Appl."},{"key":"3258_CR8","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)","journal-title":"J. Math. Imaging Vis."},{"issue":"1\u20132","key":"3258_CR9","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-dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"3258_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"key":"3258_CR11","first-page":"106","volume":"2","author":"PL Combettes","year":"2001","unstructured":"Combettes, P.L.: Fej\u00e9r-monotonicity in convex optimization. Encycl. Optim. 2, 106\u2013114 (2001)","journal-title":"Encycl. Optim."},{"issue":"2","key":"3258_CR12","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1137\/S0363012903427336","volume":"43","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L., Pennanen, T.: Proximal methods for cohypomonotone operators. SIAM J. Control. Optim. 43(2), 731\u2013742 (2004)","journal-title":"SIAM J. Control. Optim."},{"key":"3258_CR13","unstructured":"Diakonikolas, J., Daskalakis, C., Jordan, M.I.: Efficient methods for structured nonconvex-nonconcave min-max optimization. In International Conference on Artificial Intelligence and Statistics, pages 2746\u20132754. PMLR, (2021)"},{"key":"3258_CR14","doi-asserted-by":"crossref","unstructured":"Dontchev, A.L., Tyrrell, R., Rockafellar.: Regularity and conditioning of solution mappings in variational analysis. Set-Valued Anal. 12, 79\u2013109 (2004)","DOI":"10.1023\/B:SVAN.0000023394.19482.30"},{"key":"3258_CR15","doi-asserted-by":"crossref","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings: A View from Variational Analysis. Springer, New York (2009)","DOI":"10.1007\/978-0-387-87821-8"},{"issue":"1","key":"3258_CR16","doi-asserted-by":"publisher","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."},{"key":"3258_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02680553","volume":"83","author":"J Eckstein","year":"1998","unstructured":"Eckstein, J.: Approximate iterations in Bregman-function-based proximal algorithms. Math. Program. 83, 113\u2013123 (1998)","journal-title":"Math. Program."},{"issue":"4","key":"3258_CR18","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":"3258_CR19","doi-asserted-by":"crossref","unstructured":"Evens, B., Pas, P., Latafat, P., Patrinos, P.: Convergence of the preconditioned proximal point method and douglas\u2013rachford splitting in the absence of monotonicity. Mathematical Programming, pages 1\u201355, (2025)","DOI":"10.1007\/s10107-024-02182-0"},{"issue":"3","key":"3258_CR20","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1137\/20M1345062","volume":"31","author":"P Giselsson","year":"2021","unstructured":"Giselsson, P.: Nonlinear forward-backward splitting with projection correction. SIAM J. Optim. 31(3), 2199\u20132226 (2021)","journal-title":"SIAM J. Optim."},{"key":"3258_CR21","unstructured":"Guo, J., Wang, X., Xiao, X.: Preconditioned primal-dual gradient methods for nonconvex composite and finite-sum optimization. arXiv preprint arXiv:2309.13416, (2023)"},{"issue":"3","key":"3258_CR22","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1137\/21M1453463","volume":"15","author":"B He","year":"2022","unstructured":"He, B., Ma, F., Shengjie, X., 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":"2","key":"3258_CR23","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1093\/imanum\/dry092","volume":"40","author":"B He","year":"2020","unstructured":"He, B., Ma, F., Yuan, X.: Optimal proximal augmented lagrangian method and its application to full jacobian splitting for multi-block separable convex minimization problems. IMA J. Numer. Anal. 40(2), 1188\u20131216 (2020)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"3258_CR24","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 saddle-point problem: from contraction perspective. SIAM J. Imag. Sci. 5(1), 119\u2013149 (2012)","journal-title":"SIAM J. Imag. Sci."},{"key":"3258_CR25","unstructured":"Hurwicz, L.,\u00a0Arrow, K.J.,\u00a0Uzawa, H.: Studies in linear and non-linear programming. Stanford Mathematical Studies in the Social Sciences, II, Stanford University Press, Stanford, CA, (1958)"},{"issue":"4","key":"3258_CR26","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/S1052623495279569","volume":"7","author":"KC Kiwiel","year":"1997","unstructured":"Kiwiel, K.C., Lopuch, B.: Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. SIAM J. Optim. 7(4), 1084\u20131102 (1997)","journal-title":"SIAM J. Optim."},{"key":"3258_CR27","doi-asserted-by":"crossref","unstructured":"Konnov, I.V., Luc, D.T., Rubinov, A.M., Konnov, I.V.: Combined relaxation methods for generalized monotone variational inequalities. In Generalized convexity and related topics, pages 3\u201331. Springer, (2006)","DOI":"10.1007\/978-3-540-37007-9_1"},{"key":"3258_CR28","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10957-005-4716-0","volume":"126","author":"IV Konnov","year":"2005","unstructured":"Konnov, I.V., Schaible, S., Yao, J.C.: Combined relaxation method for mixed equilibrium problems. J. Optim. Theory Appl. 126, 309\u2013322 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"3258_CR29","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1019097208499","volume":"5","author":"JB Krawczyk","year":"2000","unstructured":"Krawczyk, J.B., Uryasev, S.: Relaxation algorithms to find nash equilibria with economic applications. Environ. Model. Assess. 5, 63\u201373 (2000)","journal-title":"Environ. Model. Assess."},{"key":"3258_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-backward-adjoint splitting for solving monotone inclusions involving three operators. Comput. Optim. Appl. 68, 57\u201393 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"3258_CR31","unstructured":"Lee, S., Kim, D.: Semi-anchored multi-step gradient descent ascent method for structured nonconvex-nonconcave composite minimax problems. arXiv preprint arXiv:2105.15042, (2021)"},{"issue":"2","key":"3258_CR32","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10915-020-01371-1","volume":"86","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Yunbei, X., Yin, W.: Acceleration of primal-dual methods by preconditioning and simple subproblem procedures. J. Sci. Comput. 86(2), 21 (2021)","journal-title":"J. Sci. Comput."},{"key":"3258_CR33","unstructured":"Lu, H., Yang, J.: On a unified and simplified proof for the ergodic convergence rates of ppm, pdhg and admm. arXiv preprint arXiv:2305.02165, (2023)"},{"issue":"1","key":"3258_CR34","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/16M1092015","volume":"28","author":"Y Malitsky","year":"2018","unstructured":"Malitsky, Y., Pock, T.: A first-order primal-dual algorithm with linesearch. SIAM J. Optim. 28(1), 411\u2013432 (2018)","journal-title":"SIAM J. Optim."},{"key":"3258_CR35","unstructured":"Pethick, T., Patrinos, P., Fercoq, O., Cevher\u00e5, V., Latafat, P.: Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems. In International Conference on Learning Representations, (2022)"},{"issue":"5","key":"3258_CR36","doi-asserted-by":"publisher","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":"3258_CR37","unstructured":"Rockafellar, RT.: Convex Analysis. Princeton University Press, Princeton, NJ (1970)"},{"issue":"1\u20134","key":"3258_CR38","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D 60(1\u20134), 259\u2013268 (1992)","journal-title":"Physica D"},{"issue":"4","key":"3258_CR39","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7(4), 323\u2013345 (1999)","journal-title":"Set-Valued Anal."},{"issue":"1","key":"3258_CR40","first-page":"59","volume":"6","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6(1), 59\u201370 (1999)","journal-title":"J. Convex Anal."},{"issue":"2","key":"3258_CR41","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control. Optim. 38(2), 431\u2013446 (2000)","journal-title":"SIAM J. Control. Optim."},{"key":"3258_CR42","doi-asserted-by":"crossref","unstructured":"Valkonen, T.: First-order primal\u2013dual methods for nonsmooth non-convex optimisation. Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging: Mathematical Imaging and Vision, pages 1\u201342, (2021)","DOI":"10.1007\/978-3-030-03009-4_93-1"},{"key":"3258_CR43","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10589-007-9145-6","volume":"43","author":"A Von Heusinger","year":"2009","unstructured":"Von Heusinger, A., Kanzow, C.: Optimization reformulations of the generalized nash equilibrium problem using nikaido-isoda-type functions. Comput. Optim. Appl. 43, 353\u2013377 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"3258_CR44","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.orl.2022.04.001","volume":"50","author":"H Zhang","year":"2022","unstructured":"Zhang, H.: Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems. Oper. Res. Lett. 50(3), 329\u2013334 (2022)","journal-title":"Oper. Res. Lett."},{"issue":"340","key":"3258_CR45","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1090\/mcom\/3792","volume":"92","author":"H Zhang","year":"2023","unstructured":"Zhang, H., Zhang, L., Yang, H.: Revisiting linearized Bregman iterations under lipschitz-like convexity condition. Math. Comput. 92(340), 779\u2013803 (2023)","journal-title":"Math. Comput."},{"key":"3258_CR46","first-page":"8","volume":"34","author":"M Zhu","year":"2008","unstructured":"Zhu, M., Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. Ucla Cam Report 34, 8\u201334 (2008)","journal-title":"Ucla Cam Report"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03258-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03258-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03258-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T01:11:40Z","timestamp":1782090700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03258-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,7]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3258"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03258-z","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,7]]},"assertion":[{"value":"17 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 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 they have no financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The manuscript has not been published before. All authors are aware of this submission.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Materials availability"}},{"value":"The code involved in the paper can be found at","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"92"}}