{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T14:01:25Z","timestamp":1776348085394,"version":"3.51.2"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-22-1-2757"],"award-info":[{"award-number":["N00014-22-1-2757"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1944500"],"award-info":[{"award-number":["ECCS-1944500"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["ECCS-2231863"],"award-info":[{"award-number":["ECCS-2231863"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007899","name":"University of Arizona","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007899","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11590-023-02079-5","type":"journal-article","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T03:01:37Z","timestamp":1701658897000},"page":"377-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games"],"prefix":"10.1007","volume":"18","author":[{"given":"Zeinab","family":"Alizadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3734-1082","authenticated-orcid":false,"given":"Afrooz","family":"Jalilzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farzad","family":"Yousefian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,4]]},"reference":[{"issue":"5","key":"2079_CR1","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1287\/opre.1070.0431","volume":"55","author":"X Hu","year":"2007","unstructured":"Hu, X., Ralph, D.: Using EPECs to model bilevel games in restructured electricity markets with locational prices. Oper. Res. 55(5), 809\u2013827 (2007)","journal-title":"Oper. Res."},{"issue":"4","key":"2079_CR2","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1137\/S0036144595285963","volume":"39","author":"MC Ferris","year":"1997","unstructured":"Ferris, M.C., Pang, J.-S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39(4), 669\u2013713 (1997)","journal-title":"SIAM Rev."},{"issue":"24","key":"2079_CR3","doi-asserted-by":"publisher","first-page":"6397","DOI":"10.1109\/TSP.2017.2755591","volume":"65","author":"A Deligiannis","year":"2017","unstructured":"Deligiannis, A., Panoui, A., Lambotharan, S., Chambers, J.A.: Game-theoretic power allocation and the Nash equilibrium analysis for a multistatic MIMO radar network. IEEE Trans. Signal Process. 65(24), 6397\u20136408 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"2079_CR4","unstructured":"Von\u00a0Neumann, J., Morgenstern, O.: Theory of games and economic behavior, 2nd rev (1947)"},{"key":"2079_CR5","doi-asserted-by":"crossref","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 286\u2013295 (1951)","DOI":"10.2307\/1969529"},{"issue":"1","key":"2079_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10479-009-0653-x","volume":"175","author":"F Facchinei","year":"2010","unstructured":"Facchinei, F., Kanzow, C.: Generalized Nash equilibrium problems. Ann. Oper. Res. 175(1), 177\u2013211 (2010)","journal-title":"Ann. Oper. Res."},{"key":"2079_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2023.110931","volume":"151","author":"S Krila\u0161evi\u0107","year":"2023","unstructured":"Krila\u0161evi\u0107, S., Grammatico, S.: Learning generalized Nash equilibria in monotone games: a hybrid adaptive extremum seeking control approach. Automatica 151, 110931 (2023). https:\/\/doi.org\/10.1016\/j.automatica.2023.110931","journal-title":"Automatica"},{"key":"2079_CR8","doi-asserted-by":"crossref","unstructured":"Neumann: Zur theorie der gesellschaftsspiele. Mathematische Annalens 19(2), 295\u2013320 (1928)","DOI":"10.1007\/BF01448847"},{"issue":"4","key":"2079_CR9","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: An extragradient method for finding saddle points and for other problems. Eknomika i Matematicheskie Metody 12(4), 747\u2013756 (1976)","journal-title":"Eknomika i Matematicheskie Metody"},{"issue":"3","key":"2079_CR10","first-page":"36","volume":"10","author":"E Golshtein","year":"1974","unstructured":"Golshtein, E.: Generalized gradient method for finding saddlepoints. Matekon 10(3), 36\u201352 (1974)","journal-title":"Matekon"},{"issue":"2","key":"2079_CR11","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/S1052623495290179","volume":"7","author":"GH-G Chen","year":"1997","unstructured":"Chen, G.H.-G., Rockafellar, R.T.: Convergence rates in forward\u2013backward splitting. SIAM J. Optim. 7(2), 421\u2013444 (1997). https:\/\/doi.org\/10.1137\/S1052623495290179","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2079_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence O(1\/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex\u2013concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004). https:\/\/doi.org\/10.1137\/S1052623403425629","journal-title":"SIAM J. Optim."},{"key":"2079_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10957-009-9522-7","volume":"142","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Subgradient methods for saddle-point problems. J. Optim. Theory Appl. 142, 205\u2013228 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2079_CR14","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1287\/moor.2021.1175","volume":"47","author":"R Zhao","year":"2022","unstructured":"Zhao, R.: Accelerated stochastic algorithms for convex\u2013concave saddle-point problems. Math. Oper. Res. 47(2), 1443\u20131473 (2022)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2079_CR15","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/18M1213488","volume":"31","author":"EY Hamedani","year":"2021","unstructured":"Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm with line search for general convex\u2013concave saddle point problems. SIAM J. Optim. 31(2), 1299\u20131329 (2021)","journal-title":"SIAM J. Optim."},{"key":"2079_CR16","series-title":"Springer Series in Operations Research","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, vol. I, II. Springer, New York (2003)"},{"key":"2079_CR17","unstructured":"Sanjabi, M., Ba, J., Razaviyayn, M., Lee, J.D.: On the convergence and robustness of training GANs with regularized optimal transport. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"2079_CR18","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"2079_CR19","unstructured":"Sinha, A., Namkoong, H., Duchi, J.: Certifiable distributional robustness with principled adversarial training. In: International Conference on Learning Representations (2018). https:\/\/openreview.net\/forum?id=Hk6kPgZA-"},{"key":"2079_CR20","unstructured":"Zhang, L., Xu, D., Yuan, S., Wu, X.: FairGAN: Fairness-aware generative adversarial networks. CoRR. arXiv:1805.11202 (2018)"},{"key":"2079_CR21","unstructured":"Jin, Y., Sidford, A., Tian, K.: Sharper rates for separable minimax and finite sum optimization via primal-dual extragradient methods. In: Conference on Learning Theory, pp. 4362\u20134415. PMLR (2022)"},{"key":"2079_CR22","unstructured":"Deng, Y., Kamani, M.M., Mahdavi, M.: Distributionally robust federated averaging. Adv. Neural Inf. Process. Syst. 33 (2020)"},{"issue":"5","key":"2079_CR23","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"H Scarf","year":"1967","unstructured":"Scarf, H.: The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math. 15(5), 1328\u20131343 (1967)","journal-title":"SIAM J. Appl. Math."},{"issue":"6","key":"2079_CR24","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1109\/TAC.2008.925853","volume":"53","author":"H Jiang","year":"2008","unstructured":"Jiang, H., Xu, H.: Stochastic approximation approaches to the stochastic variational inequality problem. IEEE Trans. Autom. Control 53(6), 1462\u20131475 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"2079_CR25","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1137\/110825352","volume":"22","author":"A Kannan","year":"2012","unstructured":"Kannan, A., Shanbhag, U.V.: Distributed computation of equilibria in monotone Nash games via iterative regularization techniques. SIAM J. Optim. 22(4), 1177\u20131205 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2079_CR26","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TAC.2012.2215413","volume":"58","author":"J Koshal","year":"2013","unstructured":"Koshal, J., Nedi\u0107, A., Shanbhag, U.V.: Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans. Autom. Control 58(3), 594\u2013609 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"2079_CR27","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-017-1175-y","volume":"165","author":"F Yousefian","year":"2017","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems. Math. Program. 165(1), 391\u2013431 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1175-y","journal-title":"Math. Program."},{"issue":"4","key":"2079_CR28","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s11228-018-0472-9","volume":"26","author":"F Yousefian","year":"2018","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes. Set Valued Var. Anal. 26(4), 789\u2013819 (2018). https:\/\/doi.org\/10.1007\/s11228-018-0472-9","journal-title":"Set Valued Var. Anal."},{"key":"2079_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114786","volume":"420","author":"X-J Long","year":"2023","unstructured":"Long, X.-J., He, Y.-H.: A fast stochastic approximation-based subgradient extragradient algorithm with variance reduction for solving stochastic variational inequality problems. J. Comput. Appl. Math. 420, 114786 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"2079_CR30","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/15M1031953","volume":"27","author":"AN Iusem","year":"2017","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Extragradient method with variance reduction for stochastic variational inequalities. SIAM J. Optim. 27(2), 686\u2013724 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2079_CR31","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1080\/10556788.2017.1300899","volume":"33","author":"Y Malitsky","year":"2018","unstructured":"Malitsky, Y.: Proximal extrapolated gradient methods for variational inequalities. Optim. Methods Softw. 33(1), 140\u2013164 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1300899. (PMID: 29348705)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"2079_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/10-SSY011","volume":"1","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A., Tauvel, C.: Solving variational inequalities with stochastic mirror-prox algorithm. Stoch. Syst. 1(1), 17\u201358 (2011)","journal-title":"Stoch. Syst."},{"issue":"1","key":"2079_CR33","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/17M1144799","volume":"29","author":"AN Iusem","year":"2019","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Variance-based extragradient methods with line search for stochastic variational inequalities. SIAM J. Optim. 29(1), 175\u2013206 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2079_CR34","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":"2079_CR35","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/14096757X","volume":"26","author":"Y He","year":"2016","unstructured":"He, Y., Monteiro, R.D.: An accelerated HPE-type algorithm for a class of composite convex\u2013concave saddle-point problems. SIAM J. Optim. 26(1), 29\u201356 (2016)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2079_CR36","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1080\/10556788.2016.1266355","volume":"32","author":"O Kolossoski","year":"2017","unstructured":"Kolossoski, O., Monteiro, R.D.: An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex\u2013concave saddle-point problems. Optim. Methods Softw. 32(6), 1244\u20131272 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"2079_CR37","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1137\/130943649","volume":"25","author":"Y He","year":"2015","unstructured":"He, Y., Monteiro, R.D.: Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems. SIAM J. Optim. 25(4), 2182\u20132211 (2015)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2079_CR38","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"2079_CR39","unstructured":"Zhao, R., Haskell, W.B., Tan, V.Y.: An optimal algorithm for stochastic three-composite optimization. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 428\u2013437. PMLR (2019)"},{"issue":"1","key":"2079_CR40","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0022-247X(72)90043-1","volume":"40","author":"U Mosco","year":"1972","unstructured":"Mosco, U.: Dual variational inequalities. J. Math. Anal. Appl. 40(1), 202\u2013206 (1972)","journal-title":"J. Math. Anal. Appl."},{"key":"2079_CR41","doi-asserted-by":"crossref","unstructured":"Gabay, D.: Applications of the method of multipliers to variational inequalities. vol. 15, pp. 299\u2013331. Elsevier (1983). Chap. ix. In: Studies in mathematics and its applications","DOI":"10.1016\/S0168-2024(08)70034-1"},{"issue":"1","key":"2079_CR42","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s101079900076","volume":"86","author":"J Eckstein","year":"1999","unstructured":"Eckstein, J., Ferris, M.C.: Smooth methods of multipliers for complementarity problems. Math. Program. 86(1), 65\u201390 (1999)","journal-title":"Math. Program."},{"key":"2079_CR43","unstructured":"Auslender, A.: Optimisation. M\u00e9thodes num\u00e9riques (1976)"},{"issue":"4","key":"2079_CR44","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1137\/S1052623499352656","volume":"10","author":"A Auslender","year":"2000","unstructured":"Auslender, A., Teboulle, M.: Lagrangian duality and related multiplier methods for variational inequality problems. SIAM J. Optim. 10(4), 1097\u20131115 (2000). https:\/\/doi.org\/10.1137\/S1052623499352656","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2079_CR45","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01592246","volume":"71","author":"A Auslender","year":"1995","unstructured":"Auslender, A., Haddou, M.: An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities. Math. Program. 71(1), 77\u2013100 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"2079_CR46","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/S1052623495286302","volume":"8","author":"RS Burachik","year":"1998","unstructured":"Burachik, R.S., Iusem, A.N.: A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim. 8(1), 197\u2013216 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2079_CR47","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1137\/18M1229869","volume":"30","author":"Y Xu","year":"2020","unstructured":"Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints. SIAM J. Optim. 30(2), 1664\u20131692 (2020). https:\/\/doi.org\/10.1137\/18M1229869","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2079_CR48","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1137\/20M1357378","volume":"31","author":"HD Kaushik","year":"2021","unstructured":"Kaushik, H.D., Yousefian, F.: A method with convergence rates for optimization problems with variational inequality constraints. SIAM J. Optim. 31(3), 2171\u20132198 (2021). https:\/\/doi.org\/10.1137\/20M1357378","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2079_CR49","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00934094","volume":"19","author":"S Karamardian","year":"1976","unstructured":"Karamardian, S.: An existence theorem for the complementarity problem. J. Optim. Theory Appl. 19(2), 227\u2013232 (1976)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2079_CR50","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1215\/S0012-7094-62-02933-2","volume":"29","author":"GJ Minty","year":"1962","unstructured":"Minty, G.J., et al.: Monotone (nonlinear) operators in Hilbert space. Duke Math. J. 29(3), 341\u2013346 (1962)","journal-title":"Duke Math. J."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02079-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02079-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02079-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T19:27:34Z","timestamp":1709062054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02079-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,4]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["2079"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02079-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,4]]},"assertion":[{"value":"10 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}