{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:22:37Z","timestamp":1773894157559,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T00:00:00Z","timestamp":1652832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T00:00:00Z","timestamp":1652832000000},"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\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["20ZR1420600"],"award-info":[{"award-number":["20ZR1420600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-022-01169-5","type":"journal-article","created":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T22:03:50Z","timestamp":1652825030000},"page":"551-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Zeroth-order single-loop algorithms for nonconvex-linear minimax problems"],"prefix":"10.1007","volume":"87","author":[{"given":"Jingjing","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziqi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0968-8027","authenticated-orcid":false,"given":"Zi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,18]]},"reference":[{"key":"1169_CR1","doi-asserted-by":"publisher","first-page":"020026","DOI":"10.1063\/1.5089993","volume":"2070","author":"A Al-Dujaili","year":"2019","unstructured":"Al-Dujaili, A., Srikant, S., Hemberg, E., O\u2019Reilly, U.: On the application of Danskin\u2019s theorem to derivative-free minimax optimization. AIP Conf. Proc. 2070, 020026 (2019)","journal-title":"AIP Conf. Proc."},{"key":"1169_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-021-09513-z","author":"A Berahas","year":"2021","unstructured":"Berahas, A., Cao, L., Choromanski, K., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found. Comput. Math. (2021). https:\/\/doi.org\/10.1007\/s10208-021-09513-z","journal-title":"Found. Comput. Math."},{"issue":"2","key":"1169_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10898-009-9496-x","volume":"48","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Nohadani, O.: Robust optimization with simulated annealing. J. Glob. Optim. 48(2), 323\u2013334 (2010)","journal-title":"J. Glob. Optim."},{"key":"1169_CR4","doi-asserted-by":"crossref","unstructured":"Beznosikov, A., Sadiev, A., Gasnikov, A.: Gradient-free methods with inexact oracle for convex\u2013concave stochastic saddle-point problem. In: International Conference on Mathematical Optimization Theory and Operations Research, pp. 105\u2013119. Springer (2020)","DOI":"10.1007\/978-3-030-58657-7_11"},{"key":"1169_CR5","doi-asserted-by":"crossref","unstructured":"Bot, R.I., B\u00f6hm, A.: Alternating proximal-gradient steps for (stochastic) nonconvex\u2013concave minimax problems (2022). arXiv:2007.13605","DOI":"10.1137\/21M1465470"},{"issue":"1\u20132","key":"1169_CR6","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\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"1169_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"1169_CR8","unstructured":"Daskalakis, C., Ilyas, A., Syrgkanis, V., Zeng, H.: Training GANs with Optimism. ICLR (2018)"},{"key":"1169_CR9","first-page":"9236","volume":"31","author":"C Daskalakis","year":"2018","unstructured":"Daskalakis, C., Panageas, I.: The limit points of (optimistic) gradient descent in min\u2013max optimization. NeurIPS 31, 9236\u20139246 (2018)","journal-title":"NeurIPS"},{"issue":"3","key":"1169_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1080\/05695558008974513","volume":"12","author":"Z Drezner","year":"1980","unstructured":"Drezner, Z., Wesolowsky, G.O.: A maximin location problem with maximum distance constraints. AIIE Trans. 12(3), 249\u2013252 (1980)","journal-title":"AIIE Trans."},{"key":"1169_CR11","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/25.260747","volume":"42","author":"G Foschini","year":"1993","unstructured":"Foschini, G., Miljanic, Z.: A simple distributed autonomous power control algorithm and its convergence. IEEE Trans. Veh. Technol. 42, 641\u2013646 (1993)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"1169_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10915-017-0621-6","volume":"76","author":"X Gao","year":"2018","unstructured":"Gao, X., Jiang, B., Zhang, S.: On the information-adaptive variants of the ADMM: an iteration complexity perspective. J. Sci. Comput. 76, 327\u2013363 (2018)","journal-title":"J. Sci. Comput."},{"key":"1169_CR13","unstructured":"Gidel, G., Berard, H., Vignoud, G., Vincent, P., Lacoste-Julien, S.: A Variational Inequality Perspective on Generative Adversarial Networks. ICLR (2019)"},{"key":"1169_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-019-01365-4","volume":"176","author":"D Hajinezhad","year":"2019","unstructured":"Hajinezhad, D., Hong, M.: Perturbed proximal primal\u2013dual algorithm for nonconvex non-smooth optimization. Math. Program. 176, 207\u2013245 (2019)","journal-title":"Math. Program."},{"key":"1169_CR15","doi-asserted-by":"crossref","unstructured":"Hettich, R.: A Newton-method for nonlinear Chebyshev approximation. In: Morel, J-M., Teissier, B. (eds.) Approximation Theory, pp. 222\u2013236. Springer, Heidelberg (1976)","DOI":"10.1007\/BFb0087410"},{"key":"1169_CR16","first-page":"4565","volume":"29","author":"J Ho","year":"2016","unstructured":"Ho, J., Ermon, S.: Generative adversarial imitation learning. NeurIPS 29, 4565\u20134573 (2016)","journal-title":"NeurIPS"},{"key":"1169_CR17","unstructured":"Huang, F., Gao, S., Pei, J., Huang, H.: Accelerated zeroth-order momentum methods from mini to minimax optimization. (2020). arXiv:2008.08170"},{"key":"1169_CR18","first-page":"4880","volume":"119","author":"C Jin","year":"2020","unstructured":"Jin, C., Netrapalli, P., Jordan, M.I.: What is local optimality in nonconvex\u2013nonconcave minimax optimization? PMLR 119, 4880\u20134889 (2020)","journal-title":"PMLR"},{"issue":"2","key":"1169_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0378-3758(90)90122-B","volume":"26","author":"ME Johnson","year":"1990","unstructured":"Johnson, M.E., Moore, L.M., Ylvisaker, D.: Minimax and maximin distance designs. J. Stat. Plan. Inference 26(2), 131\u2013148 (1990)","journal-title":"J. Stat. Plan. Inference"},{"key":"1169_CR20","unstructured":"Kong, W., Monteiro, R.: An accelerated inexact proximal point method for solving nonconvex-concave min-max problems. (2019). arXiv:1905.13433"},{"issue":"11","key":"1169_CR21","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y Lecun","year":"1998","unstructured":"Lecun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"IEEE"},{"issue":"84","key":"1169_CR22","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":"1169_CR23","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.1109\/TSP.2015.2414896","volume":"63","author":"W Li","year":"2015","unstructured":"Li, W., Chang, T., Chi, C.: Multicell coordinated beamforming with rate outage constraint part II: efficient approximation algorithms. IEEE Trans. Signal Process. 63, 2763\u20132778 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"1169_CR24","doi-asserted-by":"crossref","unstructured":"Liao, W., Hong, M., Farmanbar, H., Luo, Z.: Semi-asynchronous routing for large scale hierarchical networks. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2894\u20132898 (2015)","DOI":"10.1109\/ICASSP.2015.7178500"},{"key":"1169_CR25","first-page":"6083","volume":"119","author":"T Lin","year":"2020","unstructured":"Lin, T., Jin, C., Jordan, M.I.: On gradient descent ascent for nonconvex\u2013concave minimax problems. PMLR 119, 6083\u20136093 (2020)","journal-title":"PMLR"},{"key":"1169_CR26","first-page":"2738","volume":"125","author":"T Lin","year":"2020","unstructured":"Lin, T., Jin, C., Jordan, M.I.: Near-optimal algorithms for minimax optimization. PMLR 125, 2738\u20132779 (2020)","journal-title":"PMLR"},{"key":"1169_CR27","first-page":"6282","volume":"119","author":"S Liu","year":"2020","unstructured":"Liu, S., Lu, S., Chen, X., Feng, Y., Xu, K., Dujaili, A., Hong, M., OReilly, U.: Min\u2013max optimization without gradients: convergence and applications to black-box evasion and poisoning attacks. PMLR 119, 6282\u20136293 (2020)","journal-title":"PMLR"},{"key":"1169_CR28","doi-asserted-by":"publisher","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 non-convex min\u2013max problems: algorithms and applications. IEEE Trans. Signal Process. 68, 3676\u20133691 (2020)","journal-title":"IEEE Trans. Signal Process."},{"key":"1169_CR29","unstructured":"Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A: Towards deep learning models resistant to adversarial attacks. (2017). arXiv:1706.06083"},{"key":"1169_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10107-018-1326-9","volume":"179","author":"M Menickelly","year":"2020","unstructured":"Menickelly, M., Wild, S.: Derivative-free robust optimization by outer approximations. Math. Program. 179, 157\u2013193 (2020)","journal-title":"Math. Program."},{"key":"1169_CR31","unstructured":"Mohri, M., Sivek, G., Suresh, A.T.: Agnostic Federated Learning, pp. 4615\u20134625. PMLR (2019)"},{"key":"1169_CR32","unstructured":"Namkoong, H., Duchi, J.C.: Stochastic gradient methods for distributionally robust optimization with f-divergences. NeurIPS 29, 2208\u20132216 (2016)"},{"key":"1169_CR33","first-page":"14934","volume":"32","author":"M Nouiehed","year":"2019","unstructured":"Nouiehed, M., Sanjabi, M., Huang, T., Lee, J., Razaviyayn, M.: Solving a class of non-convex min\u2013max games using iterative first order methods. NeurIPS 32, 14934\u201314942 (2019)","journal-title":"NeurIPS"},{"key":"1169_CR34","doi-asserted-by":"crossref","unstructured":"Ostrovskii, D., Lowy, A., Razaviyayn, M.: Efficient search of first-order Nash equilibria in nonconvex-concave smooth min\u2013max problems. (2020). arXiv:2002.07919","DOI":"10.1137\/20M1337600"},{"issue":"1","key":"1169_CR35","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10589-020-00237-4","volume":"78","author":"W Pan","year":"2021","unstructured":"Pan, W., Shen, J., Xu, Z.: An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem. Comput. Optim. Appl. 78(1), 287\u2013306 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1169_CR36","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10898-018-0688-0","volume":"73","author":"V Picheny","year":"2019","unstructured":"Picheny, V., Binois, M., Habbal, A.: A Bayesian optimization approach to find Nash equilibria. J. Glob. Optim. 73(1), 171\u2013192 (2019)","journal-title":"J. Glob. Optim."},{"key":"1169_CR37","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. AAAI Conf. Artif. Intell. 33, 4739\u20134746 (2019)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"1169_CR38","doi-asserted-by":"crossref","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Weakly-convex min\u2013max optimization: provable algorithms and applications in machine learning. Optim. Methods Softw. 1\u201335 (2021)","DOI":"10.1080\/10556788.2021.1895152"},{"key":"1169_CR39","unstructured":"Roy, A., Chen, Y., Balasubramanian, K., Mohapatra, P.: Online and bandit algorithms for nonstationary stochastic saddle-point optimization. (2019). arXiv:1912.01698"},{"key":"1169_CR40","doi-asserted-by":"crossref","unstructured":"Sadiev, A., Beznosikov, A., Dvurechensky, P., Gasnikov, A.: Zeroth-order algorithms for smooth saddle-point problems (2020). arXiv:2009.09908","DOI":"10.1007\/978-3-030-86433-0_5"},{"key":"1169_CR41","first-page":"491","volume":"6","author":"R Schaback","year":"1995","unstructured":"Schaback, R.: Multivariate interpolation and approximation by translates of a basis function. Ser. Approx. Decompos. 6, 491\u2013514 (1995)","journal-title":"Ser. Approx. Decompos."},{"key":"1169_CR42","first-page":"12680","volume":"32","author":"K Thekumparampil","year":"2019","unstructured":"Thekumparampil, K., Jain, P., Netrapalli, P., Oh, S.: Efficient algorithms for smooth minimax optimization. NeurIPS 32, 12680\u201312691 (2019)","journal-title":"NeurIPS"},{"key":"1169_CR43","unstructured":"Wang, Z., Balasubramanian, K., Ma, S., Razaviyayn, M.: Zeroth-order algorithms for nonconvex minimax problems with improved complexities. (2020). arXiv:2001.07819"},{"issue":"3","key":"1169_CR44","first-page":"219","volume":"7","author":"DJ White","year":"1996","unstructured":"White, D.J.: A heuristic approach to a weighted maxmin dispersion problem. IMA J. Manag. Math. 7(3), 219\u2013231 (1996)","journal-title":"IMA J. Manag. Math."},{"key":"1169_CR45","doi-asserted-by":"crossref","unstructured":"Wu, Z., Jiang, B., Liu, Y., Dai Y.: Penalty approach for multiuser one-bit massive MIMO downlink with PSK signaling. IEEE ICASSP. (2022). arXiv:2110.04768","DOI":"10.1109\/ICASSP43922.2022.9747030"},{"key":"1169_CR46","unstructured":"Xu, T., Wang, Z., Liang, Y., Poor, H.: Gradient free minimax optimization: variance reduction and faster convergence. (2020). arXiv:2006.09361"},{"key":"1169_CR47","unstructured":"Xu, Z., Shen, J., Wang, Z., Dai, Y.: Zeroth-order alternating randomized gradient projection algorithms for general nonconvex\u2013concave minimax problems. (2021). arXiv:2108.00473"},{"key":"1169_CR48","unstructured":"Xu, Z., Zhang, H., Xu, Y., Lan, G.: A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex\u2013nonconcave minimax problems. (2020). arXiv:2006.02032"},{"key":"1169_CR49","first-page":"5667","volume":"33","author":"J Yang","year":"2020","unstructured":"Yang, J., Zhang, S., Kiyavash, N., He, N.: A catalyst framework for minimax optimization. NeurIPS 33, 5667\u20135678 (2020)","journal-title":"NeurIPS"},{"key":"1169_CR50","first-page":"7377","volume":"33","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Xiao, P., Sun, R., Luo, Z.: A single-loop smoothed gradient descent\u2013ascent algorithm for nonconvex\u2013concave min\u2013max problems. NeurIPS 33, 7377\u20137389 (2020)","journal-title":"NeurIPS"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01169-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01169-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01169-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T19:54:01Z","timestamp":1698782041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01169-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,18]]},"references-count":50,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1169"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01169-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,18]]},"assertion":[{"value":"22 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}