{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:22:34Z","timestamp":1773894154810,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"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":["12071279"],"award-info":[{"award-number":["12071279"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1909298"],"award-info":[{"award-number":["CCF 1909298"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["General Project No. 20ZR1420600"],"award-info":[{"award-number":["General Project No. 20ZR1420600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10107-022-01919-z","type":"journal-article","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T16:02:41Z","timestamp":1672675361000},"page":"635-706","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["A unified single-loop alternating gradient projection algorithm for nonconvex\u2013concave and convex\u2013nonconcave minimax problems"],"prefix":"10.1007","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0968-8027","authenticated-orcid":false,"given":"Zi","family":"Xu","sequence":"first","affiliation":[]},{"given":"Huiling","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Guanghui","family":"Lan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,2]]},"reference":[{"key":"1919_CR1","unstructured":"Abadeh, S.S., Esfahani, P.M.M., Kuhn, D.: Distributionally robust logistic regression. In NeurIPS, pp. 1576\u20131584 (2015)"},{"key":"1919_CR2","unstructured":"Abernethy, J., Lai, K.A., Wibisono, A.: Last-iterate convergence rates for min-max optimization. (2019) ArXiv preprint arXiv:1906.02027"},{"key":"1919_CR3","unstructured":"Adolphs, L., Daneshmand, H., Lucchi, A., Hofmann, T.: Local saddle point optimization: A curvature exploitation approach. The 22nd International Conference on Artificial Intelligence and Statistics, PMLR, pp. 486\u2013495 (2019)"},{"key":"1919_CR4","first-page":"1097","volume":"25","author":"A Krizhevsky","year":"2012","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Adv. Neural. Inf. Process. Syst. 25, 1097\u20131105 (2012)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1919_CR5","unstructured":"Krizhevsky, A, Hinton, G.: Learning multiple layers of features from tiny images (2009)"},{"key":"1919_CR6","first-page":"391","volume":"125","author":"J Bailey","year":"2020","unstructured":"Bailey, J., Gidel, G., Piliouras, G.: Finite regret and cycles with fixed step-size via alternating gradient descent-ascent. Proc. Thirty Third Conf. Learn. Theory PMLR 125, 391\u2013407 (2020)","journal-title":"Proc. Thirty Third Conf. Learn. Theory PMLR"},{"key":"1919_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge university press, Cambridge (2004)"},{"issue":"1\u20132","key":"1919_CR8","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-dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1919_CR9","doi-asserted-by":"crossref","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1919_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10107-017-1161-4","volume":"165","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Accelerated schemes for a class of variational inequalities. Math. Program. 165(1), 113\u2013149 (2017)","journal-title":"Math. Program."},{"key":"1919_CR11","unstructured":"Daskalakis, C., Ilyas, A., Syrgkanis, V., Zeng, H.: Training gans with optimism. (2017) ArXiv preprint arXiv:1711.00141"},{"key":"1919_CR12","first-page":"9236","volume":"31","author":"C Daskalakis","year":"2018","unstructured":"Daskalakis, C., Panageas, I.: The limit points of (optimistic) gradient descent in min-max optimization. Adv. Neural. Inf. Process. Syst. 31, 9236\u20139246 (2018)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1919_CR13","unstructured":"Dang, C.D., Lan, G.: Randomized first-Order methods for saddle point optimization. Technical Report, Department of Industrial and Systems Engineering, University of Florida (2015)"},{"issue":"2","key":"1919_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10589-014-9673-9","volume":"60","author":"CD Dang","year":"2015","unstructured":"Dang, C.D., Lan, G.: On the convergence properties of non-Euclidean extragradient methods for variational Inequalities with Generalized Monotone Operators. Comput. Optim. Appl. 60(2), 277\u2013310 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"1919_CR15","first-page":"10450","volume":"32","author":"L Flokas","year":"2019","unstructured":"Flokas, L., Vlatakis-Gkaragkounis, E., Piliouras, G.: Poincar\u00e9 recurrence, cycles and spurious equilibria in gradient-descent-ascent for non-convex non-concave zero-sum games. Adv. Neural. Inf. Process. Syst. 32, 10450\u201310461 (2019)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1919_CR16","doi-asserted-by":"crossref","unstructured":"Giannakis, G.B., Ling, Q., Mateos, G., Schizas, I.D., Zhu, H.: Decentralized learning for wireless communications and networking. In Splitting Methods in Communication, Imaging, Science, and Engineering pp. 461\u2013497. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-41589-5_14"},{"key":"1919_CR17","unstructured":"Gidel, G., Berard, H., Vignoud, G., Vincent, P., Lacoste-Julien, S.: A variational inequality perspective on generative adversarial networks. In International Conference on Learning Representations (2018)"},{"key":"1919_CR18","unstructured":"Gidel, G., Hemmat, R.A., Pezeshki, M., Huang, G., Lepriol, R., Lacoste-Julien, S., Mitliagkas, I.: Negative momentum for improved game dynamics. In The 22nd International Conference on Artificial Intelligence and Statistics, PMLR pp. 1802\u20131811 (2019)"},{"issue":"51","key":"1919_CR19","first-page":"1","volume":"19","author":"R Giordano","year":"2018","unstructured":"Giordano, R., Broderick, T., Jordan, M.I.: Covariances, robustness, and variational bayes. J. Mach. Learn. Res. 19(51), 1\u201349 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1919_CR20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1137\/14096757X","volume":"26","author":"Y He","year":"2016","unstructured":"He, Y., Monteiro, R.D.C.: An accelerated hpe-type algorithm for a class of composite convex-concave saddle-point problems. SIAM J. Optim. 26(1), 29\u201356 (2016)","journal-title":"SIAM J. Optim."},{"key":"1919_CR21","unstructured":"Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., Hochreiter, S.: Gans trained by a two time-scale update rule converge to a local nash equilibrium. In NeurIPS, pp. 6626\u20136637, (2017)"},{"key":"1919_CR22","first-page":"4565","volume":"29","author":"J Ho","year":"2016","unstructured":"Ho, J., Ermon, S.: Generative adversarial imitation learning. Neural. Inf. Process. Syst. 29, 4565\u20134573 (2016)","journal-title":"Neural. Inf. Process. Syst."},{"key":"1919_CR23","unstructured":"Hsieh, Y., Liu, C., Cevher, V.: Finding mixed nash equilibria of generative adversarial networks. In International Conference on Machine Learning, PMLR pp. 2810\u20132819 (2019)"},{"key":"1919_CR24","unstructured":"Jin, C., Netrapalli, P., Jordan, M.I.: Minmax optimization: stable limit points of gradient descent ascent are locally optimal. (2019) ArXiv preprint arXiv:1902.00618"},{"key":"1919_CR25","unstructured":"Kong, W., Monteiro, R.D.C.: An accelerated inexact proximal point method for solving nonconvex concave min-max problems. (2019) ArXiv preprint arXiv:1905.13433"},{"key":"1919_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-Order and Stochastic Optimization Methods for Machine Learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-Order and Stochastic Optimization Methods for Machine Learning. Springer-Nature, Berlin (2020)"},{"issue":"1\u20132","key":"1919_CR27","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10107-015-0861-x","volume":"155","author":"G Lan","year":"2016","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order augmented lagrangian methods for convex programming. Math. Program. 155(1\u20132), 511\u2013547 (2016)","journal-title":"Math. Program."},{"issue":"84","key":"1919_CR28","first-page":"1","volume":"20","author":"A Letcher","year":"2019","unstructured":"Letcher, A., Balduzzi, D., Racaniere, S., Martens, J., Foerster, J., Tuyls, K., Graepel, T.: Differentiable game mechanics. J. Mach. Learn. Res. 20(84), 1\u201340 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"1919_CR29","doi-asserted-by":"crossref","unstructured":"Liao, W., Hong, M., Farmanbar, H., Luo, Z.-Q.: Semi-asynchronous routing for large scale hierarchical networks. In Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2894\u20132898 (2015)","DOI":"10.1109\/ICASSP.2015.7178500"},{"key":"1919_CR30","unstructured":"Lin, Q., Liu, M., Rafique, H., Yang, T.: Solving weakly-convex-weakly-concave saddle-point problems as weakly-monotone variational inequality. (2018) ArXiv preprint arXiv:1810.10207"},{"key":"1919_CR31","unstructured":"Lin, T., Jin, C., Jordan, M.: On gradient descent ascent for nonconvex-concave minimax problems. In International Conference on Machine Learning, PMLR pp. 6083\u20136093 (2020)"},{"key":"1919_CR32","unstructured":"Lin, T., Jin, C., Jordan, M.: Near-optimal algorithms for minimax optimization. In Conference on Learning Theory, PMLR pp. 2738\u20132779, (2020)"},{"key":"1919_CR33","doi-asserted-by":"crossref","first-page":"3676","DOI":"10.1109\/TSP.2020.2986363","volume":"68","author":"S Lu","year":"2020","unstructured":"Lu, S., Tsaknakis, I., Hong, M., Chen, Y.: Hybrid block successive approximation for one-sided nonconvex min-max problems: algorithms and applications. IEEE Trans. Signal Process. 68, 3676\u20133691 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"1919_CR34","doi-asserted-by":"crossref","first-page":"5262","DOI":"10.1109\/TSP.2010.2055862","volume":"58","author":"G Mateos","year":"2010","unstructured":"Mateos, G., Bazerque, J.A., Giannakis, G.B.: Distributed sparse linear regression. IEEE Trans. Signal Process. 58(10), 5262\u20135276 (2010)","journal-title":"IEEE Trans. Signal Process."},{"key":"1919_CR35","unstructured":"Mazumdar, E.V., Jordan, M.I., Sastry, S.S.: On finding local nash equilibria (and only local nash equilibria) in zero-sum games. (2019) ArXiv preprint arXiv:1901.00838"},{"issue":"6","key":"1919_CR36","doi-asserted-by":"crossref","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20(6), 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1919_CR37","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1137\/100801652","volume":"21","author":"RDC Monteiro","year":"2011","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Complexity of variants of Tseng\u2019s modified F-B splitting and Korpelevich\u2019s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM J. Optim. 21(4), 1688\u20131720 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1919_CR38","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10957-009-9522-7","volume":"142","author":"A Nedic","year":"2009","unstructured":"Nedic, A., Ozdaglar, A.: Subgradient methods for saddle-point problems. J. Optim. Theory Appl. 142(1), 205\u2013228 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1919_CR39","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $${\\cal{O} }(1\/t)$$ for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"1919_CR40","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer Science and Business Media, Berlin (2003)"},{"issue":"2\u20133","key":"1919_CR41","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109(2\u20133), 319\u2013344 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"1919_CR42","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1919_CR43","first-page":"14934","volume":"32","author":"M Nouiehed","year":"2019","unstructured":"Nouiehed, M., Sanjabi, M., Huang, T., Lee, J.D.: Solving a class of nonconvex min-max games using iterative first order methods. Adv. Neural. Inf. Process. Syst. 32, 14934\u201314942 (2019)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"1","key":"1919_CR44","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E., Jr.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imag. Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imag. Sci."},{"key":"1919_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01420-0","author":"Y Ouyang","year":"2019","unstructured":"Ouyang, Y., Xu, Y.: Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. Math. Program. (2019). https:\/\/doi.org\/10.1007\/s10107-019-01420-0","journal-title":"Math. Program."},{"issue":"01","key":"1919_CR46","first-page":"4739","volume":"33","author":"Q Qian","year":"2019","unstructured":"Qian, Q., Zhu, S., Tang, J., Jin, R., Sun, B., Li, H.: Robust optimization over multiple domains. Proc. AAI Conf.Artif. Intell. 33(01), 4739\u20134746 (2019)","journal-title":"Proc. AAI Conf.Artif. Intell."},{"key":"1919_CR47","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Nonconvex min-max optimization: provable algorithms and applications in machine learning. (2018) ArXiv preprint arXiv:1810.02060,"},{"key":"1919_CR48","first-page":"7091","volume":"31","author":"M Sanjabi","year":"2018","unstructured":"Sanjabi, M., Ba, J., Razaviyayn, M., Lee, J.D.: On the convergence and robustness of training gans with regularized optimal transport. Neural. Inf. Process. Syst. 31, 7091\u20137101 (2018)","journal-title":"Neural. Inf. Process. Syst."},{"key":"1919_CR49","unstructured":"Thekumparampil, K.K., Jain, P., Netrapalli, P., Oh, S.: Efficient algorithms for smooth minimax optimization. In NeurIPS, pp. 12659\u201312670 (2019)"},{"key":"1919_CR50","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. SIAM J. Optim. 2(3), (2008). Available at http:\/\/www.mit.edu\/~dimitrib\/PTseng\/papers\/apgm.pdf"},{"key":"1919_CR51","unstructured":"Yang, J., Kiyavash, N., He, N.: Global convergence and variance-blueuced optimization for a class of nonconvex-nonconcave minimax problems. (2020) ArXiv preprint arXiv:2002.09621"},{"issue":"11","key":"1919_CR52","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"L Yann","year":"1998","unstructured":"Yann, L., L\u00e9on, B., Yoshua, B., Patrick, H.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"1919_CR53","unstructured":"Grimmer, B., Lu, H., Worah, P., Mirrokni, V.: The landscape of nonconvex-nonconcave minimax optimization. (2020) ArXiv preprint arXiv:2006.08667"},{"key":"1919_CR54","unstructured":"Mescheder, L., Geiger, A., Nowozin, S.: Which training methods for GANs do actually converge?. In International conference on machine learning, pp. 3481\u20133490, (2018)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01919-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01919-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01919-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T19:13:49Z","timestamp":1690312429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01919-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,2]]},"references-count":54,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1919"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01919-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,2]]},"assertion":[{"value":"3 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}