{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T17:00:51Z","timestamp":1772730051981,"version":"3.50.1"},"reference-count":58,"publisher":"Informa UK Limited","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-2231863"],"award-info":[{"award-number":["ECCS-2231863"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2026,1,2]]},"DOI":"10.1080\/10556788.2025.2612351","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T08:32:07Z","timestamp":1770021127000},"page":"226-255","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Variance-reduction for variational inequality problems with Bregman distance function"],"prefix":"10.1080","volume":"41","author":[{"given":"Zeinab","family":"Alizadeh","sequence":"first","affiliation":[{"name":"The University of Arizona","place":["Tucson, USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erfan","family":"Yazdandoost Hamedani","sequence":"additional","affiliation":[{"name":"The University of Arizona","place":["Tucson, USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Afrooz","family":"Jalilzadeh","sequence":"additional","affiliation":[{"name":"The University of Arizona","place":["Tucson, USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1264783"},{"key":"e_1_3_3_3_1","unstructured":"A. Alacaoglu D. Kim and S.J. Wright Extending the reach of first-order algorithms for nonconvex min-max problems with cohypomonotonicity preprint arXiv:2402.05071 (2024)."},{"key":"e_1_3_3_4_1","unstructured":"A. Alacaoglu and Y. Malitsky Stochastic variance reduction for variational inequality methods in Conference on Learning Theory. PMLR 2022 pp. 778\u2013816."},{"key":"e_1_3_3_5_1","unstructured":"Z. Allen-Zhu and E. Hazan Variance reduction for faster non-convex optimization in International conference on machine learning. PMLR 2016 pp. 699\u2013707."},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01500-6"},{"key":"e_1_3_3_7_1","unstructured":"A. B\u00f6hm Solving nonconvex-nonconcave min-max problems exhibiting weak minty solutions preprint arXiv:2201.12247 (2022)."},{"key":"e_1_3_3_8_1","unstructured":"Y. Cai and W. Zheng Accelerated single-call methods for constrained min-max optimization preprint arXiv:2210.03096 (2022)."},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_3_10_1","doi-asserted-by":"crossref","first-page":"64918","DOI":"10.52202\/075280-2833","article-title":"Single-call stochastic extragradient methods for structured non-monotone variational inequalities: Improved analysis under weaker conditions","volume":"36","author":"Choudhury S.","year":"2023","unstructured":"S. Choudhury, E. Gorbunov, and N. Loizou, Single-call stochastic extragradient methods for structured non-monotone variational inequalities: Improved analysis under weaker conditions, Adv. Neural. Inf. Process. Syst. 36 (2023), pp. 64918\u201364956.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_11_1","first-page":"64918","article-title":"Single-call stochastic extragradient methods for structured non-monotone variational inequalities: Improved analysis under weaker conditions","volume":"36","author":"Choudhury S.","year":"2024","unstructured":"S. Choudhury, E. Gorbunov, and N. Loizou, Single-call stochastic extragradient methods for structured non-monotone variational inequalities: Improved analysis under weaker conditions. Adv. Neural. Inf. Process. Syst. 36 (2024), pp. 64918\u201364956.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-70679-1"},{"key":"e_1_3_3_13_1","first-page":"5527","article-title":"Independent policy gradient methods for competitive reinforcement learning","volume":"33","author":"Daskalakis C.","year":"2020","unstructured":"C. Daskalakis, D.J. Foster, and N. Golowich, Independent policy gradient methods for competitive reinforcement learning, Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst. 33 (2020), pp. 5527\u20135540.","journal-title":"Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst."},{"key":"e_1_3_3_14_1","first-page":"5527","article-title":"Saga: A fast incremental gradient method with support for non-strongly convex composite objectives","volume":"27","author":"Defazio A.","year":"2014","unstructured":"A. Defazio, F. Bach, and S. Lacoste-Julien, Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst. 27 (2014), pp. 5527\u20135540.","journal-title":"Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst."},{"key":"e_1_3_3_15_1","first-page":"9882","article-title":"Stochastic variance reduced primal dual algorithms for empirical composition optimization","volume":"32","author":"Devraj A.M.","year":"2019","unstructured":"A.M. Devraj and J. Chen, Stochastic variance reduced primal dual algorithms for empirical composition optimization. Adv. Neural Inf. Process. Syst. 32 (2019), pp. 9882\u20139892.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_3_16_1","unstructured":"J. Diakonikolas C. Daskalakis and M.I. Jordan Efficient methods for structured nonconvex-nonconcave min-max optimization in International Conference on Artificial Intelligence and Statistics. PMLR 2021 pp. 2746\u20132754."},{"key":"e_1_3_3_17_1","first-page":"687","article-title":"SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator","volume":"31","author":"Fang C.","year":"2018","unstructured":"C. Fang, C.J. Li, Z. Lin, and T. Zhang, SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator. Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural. Inf. Process. Syst. 31 (2018), pp. 687\u2013697.","journal-title":"Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_18_1","first-page":"2672","article-title":"Generative adversarial nets","volume":"27","author":"Goodfellow I.","year":"2014","unstructured":"I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, Generative adversarial nets. Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst. 27 (2014), pp. 2672\u20132680.","journal-title":"Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst."},{"key":"e_1_3_3_19_1","unstructured":"E. Gorbunov H. Berard G. Gidel and N. Loizou Stochastic extragradient: General analysis and improved rates in International Conference on Artificial Intelligence and Statistics. PMLR 2022 pp. 7865\u20137901."},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683562"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1213488"},{"key":"e_1_3_3_22_1","first-page":"1","article-title":"Lower complexity bounds of finite-sum optimization problems: The results and construction","volume":"25","author":"Han Y.","year":"2024","unstructured":"Y. Han, G. Xie, and Z. Zhang, Lower complexity bounds of finite-sum optimization problems: The results and construction, J. Mach. Learn. Res. 25 (2024), pp. 1\u201386.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1031953"},{"key":"e_1_3_3_24_1","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"Johnson R.","year":"2013","unstructured":"R. Johnson and T. Zhang, Accelerating stochastic gradient descent using predictive variance reduction. Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst. 26 (2013), pp. 315\u2013323.","journal-title":"Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural Inf. Process. Syst."},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/10-SSY011"},{"key":"e_1_3_3_26_1","first-page":"23524","article-title":"Adaptive stochastic variance reduction for non-convex finite-sum minimization","volume":"35","author":"Kavis A.","year":"2022","unstructured":"A. Kavis, S. Skoulakis, K. Antonakopoulos, L.T. Dadi, and V. Cevher, Adaptive stochastic variance reduction for non-convex finite-sum minimization, Adv. Neural Inf. Process. Syst. 35 (2022), pp. 23524\u201323538.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402714"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-011-9981-5"},{"key":"e_1_3_3_29_1","unstructured":"X. Lian M. Wang and J. Liu Finite-sum composition optimization via variance reduced gradient descent in Artificial Intelligence and Statistics. PMLR 2017 pp. 1159\u20131167."},{"key":"e_1_3_3_30_1","unstructured":"L. Luo G. Xie T. Zhang and Z. Zhang Near optimal stochastic algorithms for finite-sum unbalanced convex-concave minimax optimization preprint arXiv:2106.01761 (2021)."},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1207260"},{"key":"e_1_3_3_32_1","unstructured":"X. Mao Bregman generalized subgradient projected algorithms and applications Ph.D. diss. University of British Columbia 2023."},{"key":"e_1_3_3_33_1","article-title":"Stochastic gradient methods for distributionally robust optimization with f-divergences","volume":"29","author":"Namkoong H.","year":"2016","unstructured":"H. Namkoong and J.C. Duchi, Stochastic gradient methods for distributionally robust optimization with f-divergences, Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural. Inf. Process. Syst. 29 (2016).","journal-title":"Neural Information Processing Systems\u00a1\/DIFdel\u00bfAdv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"e_1_3_3_35_1","first-page":"1574","article-title":"Robust stochastic approximation approach to stochastic programming","volume":"19","author":"Nemirovski A.","year":"2009","unstructured":"A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro, Robust stochastic approximation approach to stochastic programming, Optimization\u00a1\/DIFdel\u00bfSIAM J. Optim. 19 (2009), pp. 1574\u20131609.","journal-title":"Optimization\u00a1\/DIFdel\u00bfSIAM J. Optim."},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0034-z"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.2307\/2296111"},{"key":"e_1_3_3_38_1","unstructured":"L.M. Nguyen J. Liu K. Scheinberg and M. Tak\u00e1\u010d SARAH: A novel method for machine learning problems using stochastic recursive gradient in International conference on machine learning. PMLR 2017 pp. 2613\u20132621."},{"key":"e_1_3_3_39_1","first-page":"2208","article-title":"Stochastic variance reduction methods for saddle-point problems","volume":"29","author":"Palaniappan B.","year":"2016","unstructured":"B. Palaniappan and F. Bach, Stochastic variance reduction methods for saddle-point problems. Adv. Neural. Inf. Process. Syst. 29 (2016), pp. 2208\u20132216.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2018.11.012"},{"key":"e_1_3_3_41_1","unstructured":"T. Pethick O. Fercoq P. Latafat P. Patrinos and V. Cevher Solving stochastic weak minty variational inequalities without increasing batch size preprint arXiv:2302.09029 (2023)."},{"key":"e_1_3_3_42_1","unstructured":"T. Pethick P. Latafat P. Patrinos O. Fercoq and V. Cevher Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems preprint arXiv:2302.09831 (2023)."},{"key":"e_1_3_3_43_1","first-page":"49830","article-title":"Stable nonconvex-nonconcave training via linear interpolation","volume":"36","author":"Pethick T.","year":"2023","unstructured":"T. Pethick, W. Xie, and V. Cevher, Stable nonconvex-nonconcave training via linear interpolation. Adv. Neural. Inf. Process. Syst. 36 (2023), pp. 49830\u201349841.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2024.115396"},{"key":"e_1_3_3_45_1","volume-title":"Convex Analysis","author":"Rockafellar R.T.","year":"1997","unstructured":"R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, 1997."},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"e_1_3_3_47_1","first-page":"6031","article-title":"Bregman divergence for stochastic variance reduction: Saddle-point and adversarial prediction","volume":"30","author":"Shi Z.","year":"2017","unstructured":"Z. Shi, X. Zhang, and Y. Yu, Bregman divergence for stochastic variance reduction: Saddle-point and adversarial prediction. Adv. Neural Inf. Process. Syst. 30 (2017), pp. 6031\u20136041.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_3_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-10592-0_43"},{"key":"e_1_3_3_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0664-8"},{"key":"e_1_3_3_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1470104"},{"key":"e_1_3_3_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012998338806"},{"key":"e_1_3_3_52_1","article-title":"On accelerated proximal gradient methods for convex-concave optimization","volume":"2","author":"Tseng P.","year":"2008","unstructured":"P. Tseng, On accelerated proximal gradient methods for convex-concave optimization, SIAM J. Optim.2 (2008).","journal-title":"SIAM J. Optim."},{"key":"e_1_3_3_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmateco.2016.02.004"},{"key":"e_1_3_3_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-023-01348-y"},{"key":"e_1_3_3_55_1","unstructured":"J. Yang N. Kiyavash and N. He Global convergence and variance-reduced optimization for a class of nonconvex-nonconcave minimax problems preprint arXiv:2002.09621 (2020)."},{"key":"e_1_3_3_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108068"},{"key":"e_1_3_3_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-023-00472-5"},{"key":"e_1_3_3_58_1","unstructured":"J. Zhang and L. Xiao A composite randomized incremental gradient method in International Conference on Machine Learning. PMLR 2019 pp. 7454\u20137462."},{"key":"e_1_3_3_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-022-01488-0"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2025.2612351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:01:07Z","timestamp":1772726467000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2025.2612351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,2]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1,2]]}},"alternative-id":["10.1080\/10556788.2025.2612351"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2025.2612351","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2025-01-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}