{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:51:45Z","timestamp":1776743505605,"version":"3.51.2"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["CA16228"],"award-info":[{"award-number":["CA16228"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider monotone inclusions defined on a Hilbert space where the operator is given by the sum of a maximal monotone operator<jats:italic>T<\/jats:italic>and a single-valued monotone, Lipschitz continuous, and expectation-valued operator<jats:italic>V<\/jats:italic>. We draw motivation from the seminal work by Attouch and Cabot (Attouch in AMO 80:547\u2013598, 2019, Attouch in MP 184: 243\u2013287) on relaxed inertial methods for monotone inclusions and present a stochastic extension of the relaxed inertial forward\u2013backward-forward method. Facilitated by an online variance reduction strategy via a mini-batch approach, we show that our method produces a sequence that weakly converges to the solution set. Moreover, it is possible to estimate the rate at which the discrete velocity of the stochastic process vanishes. Under strong monotonicity, we demonstrate strong convergence, and give a detailed assessment of the iteration and oracle complexity of the scheme. When the mini-batch is raised at a geometric (polynomial) rate, the rate statement can be strengthened to a linear (suitable polynomial) rate while the oracle complexity of computing an<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\epsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03f5<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-solution improves to<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}(1\/\\epsilon )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mo>(<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>\/<\/mml:mo><mml:mi>\u03f5<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Importantly, the latter claim allows for possibly biased oracles, a key theoretical advancement allowing for far broader applicability. By defining a restricted gap function based on the Fitzpatrick function, we prove that the expected gap of an averaged sequence diminishes at a sublinear rate of<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}(1\/k)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mo>(<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>\/<\/mml:mo><mml:mi>k<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>while the oracle complexity of computing a suitably defined<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\epsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03f5<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-solution is<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}(1\/\\epsilon ^{1+a})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>O<\/mml:mi><mml:mo>(<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>\/<\/mml:mo><mml:msup><mml:mi>\u03f5<\/mml:mi><mml:mrow><mml:mn>1<\/mml:mn><mml:mo>+<\/mml:mo><mml:mi>a<\/mml:mi><\/mml:mrow><\/mml:msup><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>where<jats:inline-formula><jats:alternatives><jats:tex-math>$$a &gt; 1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>a<\/mml:mi><mml:mo>&gt;<\/mml:mo><mml:mn>1<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Numerical results on two-stage games and an overlapping group Lasso problem illustrate the advantages of our method compared to competitors.<\/jats:p>","DOI":"10.1007\/s10589-022-00399-3","type":"journal-article","created":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T14:02:42Z","timestamp":1659189762000},"page":"465-524","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces"],"prefix":"10.1007","volume":"83","author":[{"given":"Shisheng","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uday","family":"Shanbhag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2481-0019","authenticated-orcid":false,"given":"Mathias","family":"Staudigl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phan","family":"Vuong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"issue":"3","key":"399_CR1","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00245-019-09584-z","volume":"80","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Cabot, A.: Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions. Appl. Math. Optim. 80(3), 547\u2013598 (2019). https:\/\/doi.org\/10.1007\/s00245-019-09584-z","journal-title":"Appl. Math. Optim."},{"issue":"1","key":"399_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10107-019-01412-0","volume":"184","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Cabot, A.: Convergence of a relaxed inertial proximal algorithm for maximally monotone operators. Math. Program. 184(1), 243\u2013287 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01412-0","journal-title":"Math. Program."},{"key":"399_CR3","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, (2016)","DOI":"10.1007\/978-3-319-48311-5_2"},{"key":"399_CR4","doi-asserted-by":"crossref","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems - Volume I and Volume II. Springer, (2003)","DOI":"10.1007\/b97544"},{"issue":"1","key":"399_CR5","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), 259\u2013268 (1992). https:\/\/doi.org\/10.1016\/0167-2789(92)90242-F","journal-title":"Physica D"},{"key":"399_CR6","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.-P.: Group lasso with overlap and graph lasso. Proceedings of the 26th annual international conference on machine learning, pp. 433\u2013440 (2009)","DOI":"10.1145\/1553374.1553431"},{"issue":"6A","key":"399_CR7","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1214\/07-AOS584","volume":"37","author":"P Zhao","year":"2009","unstructured":"Zhao, P., Rocha, G., Yu, B.: The composite absolute penalties family for grouped and hierarchical variable selection. Ann. Stat. 37(6A), 3468\u20133497 (2009). https:\/\/doi.org\/10.1214\/07-AOS584","journal-title":"Ann. Stat."},{"issue":"1","key":"399_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., Knight, K.: Sparsity and smoothness via the fused lasso. J. Royal Statistical Soc.: Series B (Statistical Methodology) 67(1), 91\u2013108 (2005). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00490.x","journal-title":"J. Royal Statistical Soc.: Series B (Statistical Methodology)"},{"issue":"3","key":"399_CR9","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1214\/11-AOS878","volume":"39","author":"RJ Tibshirani","year":"2011","unstructured":"Tibshirani, R.J., Taylor, J.: The solution path of the generalized lasso. Ann. Statist. 39(3), 1335\u20131371 (2011). https:\/\/doi.org\/10.1214\/11-AOS878","journal-title":"Ann. Statist."},{"issue":"5","key":"399_CR10","doi-asserted-by":"publisher","first-page":"3246","DOI":"10.1137\/090754297","volume":"48","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Briceno-Arias, L.M., Combettes, P.L.: A parallel splitting method for coupled monotone inclusions. SIAM J. Control. Optim. 48(5), 3246\u20133270 (2010). https:\/\/doi.org\/10.1137\/090754297","journal-title":"SIAM J. Control. Optim."},{"issue":"10","key":"399_CR11","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1109\/TAC.2019.2906924","volume":"64","author":"P Latafat","year":"2019","unstructured":"Latafat, P., Freris, N.M., Patrinos, P.: A new randomized block-coordinate primal-dual proximal algorithm for distributed optimization. IEEE Trans. Autom. Control 64(10), 4050\u20134065 (2019). https:\/\/doi.org\/10.1109\/TAC.2019.2906924","journal-title":"IEEE Trans. Autom. Control"},{"key":"399_CR12","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. Society for Industrial and Applied Mathematics (1974)","DOI":"10.1137\/1.9781611970524"},{"issue":"2","key":"399_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11228-011-0191-y","volume":"20","author":"PL Combettes","year":"2012","unstructured":"Combettes, P.L., Pesquet, J.-C.: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators. Set-Valued and variational analysis 20(2), 307\u2013330 (2012)","journal-title":"Set-Valued and variational analysis"},{"issue":"6","key":"399_CR14","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). https:\/\/doi.org\/10.1109\/TAC.2008.925853","journal-title":"IEEE Trans. Autom. Control"},{"key":"399_CR15","doi-asserted-by":"publisher","unstructured":"Shanbhag, U.V.: Chapter 5. Stochastic Variational Inequality Problems: Applications, Analysis, and Algorithms, pp. 71\u2013107 (2013). https:\/\/doi.org\/10.1287\/educ.2013.0120","DOI":"10.1287\/educ.2013.0120"},{"issue":"3","key":"399_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ifacol.2019.06.021","volume":"52","author":"M Staudigl","year":"2019","unstructured":"Staudigl, M., Mertikopoulos, P.: Convergent noisy forward-backward-forward algorithms in non-monotone variational inequalities. IFAC-PapersOnLine 52(3), 120\u2013125 (2019)","journal-title":"IFAC-PapersOnLine"},{"key":"399_CR17","doi-asserted-by":"crossref","unstructured":"Mertikopoulos, P., Staudigl, M.: Convergence to Nash Equilibrium in Continuous Games with Noisy First-order Feedback. In: 56th IEEE Conference on Decision and Control (2017)","DOI":"10.1109\/CDC.2017.8264505"},{"key":"399_CR18","doi-asserted-by":"crossref","unstructured":"Briceno-Arias, L.M., Combettes, P.L.: Monotone operator methods for Nash equilibria in non-potential games, pp. 143\u2013159. Springer, ??? (2013)","DOI":"10.1007\/978-1-4614-7621-4_9"},{"key":"399_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.automatica.2019.01.008","volume":"102","author":"P Yi","year":"2019","unstructured":"Yi, P., Pavel, L.: An operator splitting approach for distributed generalized Nash equilibria computation. Automatica 102, 111\u2013121 (2019). https:\/\/doi.org\/10.1016\/j.automatica.2019.01.008","journal-title":"Automatica"},{"key":"399_CR20","doi-asserted-by":"publisher","unstructured":"Franci, B., Staudigl, M., Grammatico, S.: Distributed forward-backward (half) forward algorithms for generalized nash equilibrium seeking. In: 2020 European Control Conference (ECC), pp. 1274\u20131279 (2020). https:\/\/doi.org\/10.23919\/ECC51009.2020.9143676","DOI":"10.23919\/ECC51009.2020.9143676"},{"issue":"1","key":"399_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1287\/opre.41.1.179","volume":"41","author":"TL Friesz","year":"1993","unstructured":"Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L., Wie, B.W.: Variational inequality formulation of the dynamic network user equilibrium. Oper. Res. 41(1), 179\u2013191 (1993)","journal-title":"Oper. Res."},{"issue":"1","key":"399_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02592328","volume":"72","author":"M Fukushima","year":"1996","unstructured":"Fukushima, M.: The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem. Math. Program. 72(1), 1\u201315 (1996). https:\/\/doi.org\/10.1007\/BF02592328","journal-title":"Math. Program."},{"issue":"3","key":"399_CR23","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/s11067-018-9433-y","volume":"19","author":"K Han","year":"2019","unstructured":"Han, K., Eve, G., Friesz, T.L.: Computing dynamic user equilibria on large-scale networks with software implementation. Netw. Spat. Econ. 19(3), 869\u2013902 (2019). https:\/\/doi.org\/10.1007\/s11067-018-9433-y","journal-title":"Netw. Spat. Econ."},{"key":"399_CR24","doi-asserted-by":"publisher","unstructured":"B\u00f6rgens, E., Kanzow, C.: ADMM-type methods for generalized Nash equilibrium problems in Hilbert spaces. SIAM J. Optim., 377\u2013403 (2021). https:\/\/doi.org\/10.1137\/19M1284336","DOI":"10.1137\/19M1284336"},{"issue":"2","key":"399_CR25","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). https:\/\/doi.org\/10.1137\/S0363012998338806","journal-title":"SIAM J. Control. Optim."},{"key":"399_CR26","doi-asserted-by":"publisher","unstructured":"Bo\u0163, R.I., Mertikopoulos, P., Staudigl, M., Vuong, P.T.: Minibatch forward-backward-forward methods for solving stochastic variational inequalities. Stochastic Syst. (2021) https:\/\/doi.org\/10.1287\/stsy.2019.0064. https:\/\/doi.org\/10.1287\/stsy.2019.0064","DOI":"10.1287\/stsy.2019.0064"},{"key":"399_CR27","doi-asserted-by":"crossref","unstructured":"Cui, S., Shanbhag, U.V.: On the computation of equilibria in monotone and potential stochastic hierarchical game. arXiv preprint arXiv:2104.07860 (2021)","DOI":"10.1007\/s10107-022-01897-2"},{"key":"399_CR28","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s11067-021-09548-3","volume":"21","author":"DV Thong","year":"2021","unstructured":"Thong, D.V., Gibali, A., Staudigl, M., Vuong, P.T.: Computing dynamic user equilibrium on large-scale networks without knowing global parameters. Netw. Spat. Econ. 21, 735\u2013768 (2021)","journal-title":"Netw. Spat. Econ."},{"key":"399_CR29","unstructured":"Diakonikolas, J., Daskalakis, C., Jordan, M.: Efficient methods for structured nonconvex-nonconcave min-max optimization. International Conference on Artificial Intelligence and Statistics, pp. 2746\u20132754 (2021)"},{"key":"399_CR30","unstructured":"Fitzpatrick, S.: Representing monotone operators by convex functions. In: Workshop\/Miniconference on Functional Analysis and Optimization, pp. 59\u201365 (1988). Centre for Mathematics and its Applications, Mathematical Sciences Institute\u00a0.."},{"key":"399_CR31","doi-asserted-by":"crossref","unstructured":"Simons, S., Zalinescu, C.: A new proof for Rockafellar\u2019s characterization of maximal monotone operators 132(10), 2969\u20132972 (2004)","DOI":"10.1090\/S0002-9939-04-07462-3"},{"issue":"2","key":"399_CR32","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/15M1031953","volume":"27","author":"A Iusem","year":"2017","unstructured":"Iusem, A., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Extragradient method with variance reduction for stochastic variational inequalities. SIAM J. Optim. 27(2), 686\u201372410526234 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"399_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). https:\/\/doi.org\/10.1137\/17M1144799","journal-title":"SIAM J. Optim."},{"issue":"3","key":"399_CR34","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1137\/18M1200208","volume":"29","author":"C Geiersbach","year":"2019","unstructured":"Geiersbach, C., Pflug, G.C.: Projected stochastic gradients for convex constrained problems in Hilbert spaces. SIAM J. Optim. 29(3), 2079\u20132099 (2019). https:\/\/doi.org\/10.1137\/18M1200208","journal-title":"SIAM J. Optim."},{"issue":"5","key":"399_CR35","doi-asserted-by":"publisher","first-page":"2750","DOI":"10.1137\/19M1263297","volume":"42","author":"C Geiersbach","year":"2020","unstructured":"Geiersbach, C., Wollner, W.: A stochastic gradient method with mesh refinement for PDE-constrained optimization under uncertainty. SIAM J. Sci. Comput. 42(5), 2750\u20132772 (2020). https:\/\/doi.org\/10.1137\/19M1263297","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"399_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964). https:\/\/doi.org\/10.1016\/0041-5553(64)90137-5","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"399_CR37","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization, vol. 87. Kluwer Academic Publishers, (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"399_CR38","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, (1987)"},{"issue":"3","key":"399_CR39","first-page":"836","volume":"17","author":"H Attouch","year":"2011","unstructured":"Attouch, H., Maing\u00e9, P.-E.: Asymptotic behavior of second-order dissipative evolution equations combining potential with non-potential effects. ESAIM: Control, Opt. Calculus of Variations 17(3), 836\u2013857 (2011)","journal-title":"ESAIM: Control, Opt. Calculus of Variations"},{"issue":"3","key":"399_CR40","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1137\/15M1012657","volume":"54","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.: Second order forward-backward dynamical systems for monotone inclusion problems. SIAM J. Control. Optim. 54(3), 1423\u20131443 (2016). https:\/\/doi.org\/10.1137\/15M1012657","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"399_CR41","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-018-1252-x","volume":"174","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Peypouquet, J.: Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators. Math. Program. 174(1), 391\u2013432 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1252-x","journal-title":"Math. Program."},{"key":"399_CR42","unstructured":"Su, W., Boyd, S., Candes, E.J.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. J. Mach. Learn. Res. (2016)"},{"issue":"2","key":"399_CR43","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$o(1\/k^{2})$$. Soviet Math. Doklady 27(2), 372\u2013376 (1983)","journal-title":"Soviet Math. Doklady"},{"issue":"1","key":"399_CR44","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/18-EJS1395","volume":"12","author":"S Gadat","year":"2018","unstructured":"Gadat, S., Panloup, F., Saadane, S.: Stochastic heavy ball. Electron. J. Statistics 12(1), 461\u2013529 (2018). https:\/\/doi.org\/10.1214\/18-EJS1395","journal-title":"Electron. J. Statistics"},{"issue":"2","key":"399_CR45","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10851-014-0523-2","volume":"51","author":"DA Lorenz","year":"2015","unstructured":"Lorenz, D.A., Pock, T.: An inertial forward-backward algorithm for monotone inclusions. J. Math. Imag. Vis. 51(2), 311\u2013325 (2015). https:\/\/doi.org\/10.1007\/s10851-014-0523-2","journal-title":"J. Math. Imag. Vis."},{"issue":"4","key":"399_CR46","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1137\/10081602X","volume":"21","author":"LM Brice\u00f1o-Arias","year":"2011","unstructured":"Brice\u00f1o-Arias, L.M., Combettes, P.L.: A monotone+skew splitting model for composite monotone inclusions in duality. SIAM J. Optim. 21(4), 1230\u20131250 (2011). https:\/\/doi.org\/10.1137\/10081602X","journal-title":"SIAM J. Optim."},{"issue":"3","key":"399_CR47","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s11075-015-0007-5","volume":"71","author":"RI Bot","year":"2016","unstructured":"Bot, R.I., Csetnek, E.R.: An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems. Num. Algorithms 71(3), 519\u2013540 (2016). https:\/\/doi.org\/10.1007\/s11075-015-0007-5","journal-title":"Num. Algorithms"},{"key":"399_CR48","unstructured":"Bot, R.I., Sedlmayer, M., Vuong, P.T.: A relaxed inertial forward-backward-forward algorithm for solving monotone inclusions with application to GANS. arXiv preprint arXiv:2003.07886 (2020)"},{"issue":"4","key":"399_CR49","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":"399_CR50","doi-asserted-by":"publisher","unstructured":"Juditsky, A., Nemirovski, A., Tauvel, C.: Solving variational inequalities with stochastic mirror-prox algorithm, pp. 17\u201358 (2011). https:\/\/doi.org\/10.1214\/10-SSY011","DOI":"10.1214\/10-SSY011"},{"issue":"1","key":"399_CR51","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."},{"key":"399_CR52","unstructured":"Gidel, G., Berard, H., Vignoud, G., Vincent, P., Lacoste-Julien, S.: A variational inequality perspective on generative adversarial networks. arXiv preprint arXiv:1802.10551 (2018)"},{"key":"399_CR53","unstructured":"Mishchenko, K., Kovalev, D., Shulgin, E., Richt\u00e1rik, P., Malitsky, Y.: Revisiting stochastic extragradient. In: International Conference on Artificial Intelligence and Statistics, pp. 4573\u20134582 (2020). PMLR"},{"issue":"3","key":"399_CR54","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s10589-019-00120-x","volume":"74","author":"A Kannan","year":"2019","unstructured":"Kannan, A., Shanbhag, U.V.: Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants. Comput. Optim. Appl. 74(3), 779\u2013820 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"399_CR55","doi-asserted-by":"crossref","unstructured":"Cui, S., Shanbhag, U.V.: On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems. Set-Valued and Variational Analysis (to appear) (2021)","DOI":"10.1007\/s11228-021-00572-6"},{"issue":"6","key":"399_CR56","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1080\/02331934.2015.1127371","volume":"65","author":"L Rosasco","year":"2016","unstructured":"Rosasco, L., Villa, S., V\u0169, B.C.: A stochastic inertial forward-backward splitting algorithm for multivariate monotone inclusions. Optimization 65(6), 1293\u20131314 (2016). https:\/\/doi.org\/10.1080\/02331934.2015.1127371","journal-title":"Optimization"},{"key":"399_CR57","unstructured":"Palaniappan, B., Bach, F.: Stochastic variance reduction methods for saddle-point problems. In: Advances in Neural Information Processing Systems, pp. 1416\u20131424 (2016)"},{"issue":"11","key":"399_CR58","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1109\/JPROC.2020.3028013","volume":"108","author":"RM Gower","year":"2020","unstructured":"Gower, R.M., Schmidt, M., Bach, F., Richt\u00e1rik, P.: Variance-reduced methods for machine learning. Proc. IEEE 108(11), 1968\u20131983 (2020). https:\/\/doi.org\/10.1109\/JPROC.2020.3028013","journal-title":"Proc. IEEE"},{"issue":"3","key":"399_CR59","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1137\/110830629","volume":"34","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Schmidt, M.: Hybrid deterministic-stochastic methods for data fitting. SIAM J. Sci. Comput. 34(3), 1380\u20131405 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"399_CR60","unstructured":"Jalilzadeh, A., Shanbhag, U.V., Blanchet, J.H., Glynn, P.W.: Smoothed variable sample-size accelerated proximal methods for nonsmooth stochastic convex programs. arXiv preprint arXiv:1803.00718 (2018)"},{"issue":"1\u20132","key":"399_CR61","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-018-1297-x","volume":"174","author":"A Jofr\u00e9","year":"2019","unstructured":"Jofr\u00e9, A., Thompson, P.: On variance reduction for stochastic smooth convex optimization with multiplicative noise. Math. Program. 174(1\u20132), 253\u2013292 (2019)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"399_CR62","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155(1\u20132), 267\u2013305 (2016)","journal-title":"Math. Program."},{"key":"399_CR63","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0962492914000075","volume":"23","author":"MD Gunzburger","year":"2014","unstructured":"Gunzburger, M.D., Webster, C.G., Zhang, G.: Stochastic finite element methods for partial differential equations with random input data. Acta Numer. 23, 521\u2013650 (2014)","journal-title":"Acta Numer."},{"key":"399_CR64","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Dordrecht (2004)"},{"issue":"1","key":"399_CR65","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"key":"399_CR66","doi-asserted-by":"crossref","unstructured":"Lan, G.: First-order and Stochastic Optimization Methods for Machine Learning. Springer Series in the Data Sciences. Springer, (2020)","DOI":"10.1007\/978-3-030-39568-1"},{"issue":"2","key":"399_CR67","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic Quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping. SIAM J. Optim. 25(2), 1221\u20131248 (2015). https:\/\/doi.org\/10.1137\/140971233","journal-title":"SIAM J. Optim."},{"issue":"1","key":"399_CR68","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-018-1296-y","volume":"174","author":"PL Combettes","year":"2019","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic Quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping ii: mean-square and linear convergence. Math. Program. 174(1), 433\u2013451 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1296-y","journal-title":"Math. Program."},{"issue":"2","key":"399_CR69","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/s10957-016-0893-2","volume":"169","author":"L Rosasco","year":"2016","unstructured":"Rosasco, L., Villa, S., V\u0169, B.C.: Stochastic Forward-Backward splitting for monotone inclusions. J. Optim. Theory Appl. 169(2), 388\u2013406 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0893-2","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"399_CR70","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"JC Spall","year":"1992","unstructured":"Spall, J.C.: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans. Autom. Control 37(3), 332\u2013341 (1992)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"399_CR71","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0005-1098(96)00149-5","volume":"33","author":"JC Spall","year":"1997","unstructured":"Spall, J.C.: A one-measurement form of simultaneous perturbation stochastic approximation. Automatica 33(1), 109\u2013112 (1997)","journal-title":"Automatica"},{"key":"399_CR72","unstructured":"Duvocelle, B., Mertikopoulos, P., Staudigl, M., Vermeulen, D.: Learning in time-varying games. arXiv preprint arXiv:1809.03066 (2018)"},{"issue":"3","key":"399_CR73","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1287\/moor.1070.0253","volume":"32","author":"K Barty","year":"2007","unstructured":"Barty, K., Roy, J.-S., Strugarek, C.: Hilbert-valued perturbed subgradient algorithms. Math. Oper. Res. 32(3), 551\u2013562 (2007). https:\/\/doi.org\/10.1287\/moor.1070.0253","journal-title":"Math. Oper. Res."},{"issue":"1","key":"399_CR74","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10107-007-0201-x","volume":"119","author":"K Barty","year":"2009","unstructured":"Barty, K., Roy, J.-S., Strugarek, C.: A stochastic gradient type algorithm for closed-loop problems. Math. Program. 119(1), 51\u201378 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0201-x","journal-title":"Math. Program."},{"key":"399_CR75","unstructured":"Lei, J., Shanbhag, U.V.: Distributed variable sample-size gradient-response and best-response schemes for stochastic Nash equilibrium problems over graphs. arXiv:1811.11246 (2019)"},{"key":"399_CR76","doi-asserted-by":"crossref","unstructured":"Lei, J., Shanbhag, U.V.: Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes. Optimization Methods and Software, pp. 1\u201331 (2020)","DOI":"10.1080\/10556788.2020.1746963"},{"issue":"3","key":"399_CR77","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10957-015-0813-x","volume":"171","author":"JM Borwein","year":"2016","unstructured":"Borwein, J.M., Dutta, J.: Maximal monotone inclusions and Fitzpatrick functions. J. Optim. Theory Appl. 171(3), 757\u2013784 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"399_CR78","doi-asserted-by":"crossref","unstructured":"Auslender, A., Gourgand, M., Guillet, A.: Resolution numerique d\u2019inegalites variationnelles. In: Lecture Notes in Economics and Mathematical Systems (Mathematical Economics) (1974)","DOI":"10.1007\/978-3-662-00638-2_1"},{"issue":"4","key":"399_CR79","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/130919362","journal-title":"SIAM J. Optim."},{"issue":"6","key":"399_CR80","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/090753127","journal-title":"SIAM J. Optim."},{"key":"399_CR81","doi-asserted-by":"publisher","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Accelerated schemes for a class of variational inequalities. Math. Program. (2017). https:\/\/doi.org\/10.1007\/s10107-017-1161-4","DOI":"10.1007\/s10107-017-1161-4"},{"issue":"2","key":"399_CR82","doi-asserted-by":"publisher","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), 319\u2013344 (2007). https:\/\/doi.org\/10.1007\/s10107-006-0034-z","journal-title":"Math. Program."},{"issue":"1","key":"399_CR83","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-019-01416-w","volume":"184","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y.: Golden ratio algorithms for variational inequalities. Math. Program. 184(1), 383\u2013410 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01416-w","journal-title":"Math. Program."},{"issue":"1","key":"399_CR84","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s11228-019-00517-0","volume":"28","author":"RS Burachik","year":"2020","unstructured":"Burachik, R.S., Mill\u00e1n, R.D.: A projection algorithm for non-monotone variational inequalities. Set-Valued and Variational Anal. 28(1), 149\u2013166 (2020). https:\/\/doi.org\/10.1007\/s11228-019-00517-0","journal-title":"Set-Valued and Variational Anal."},{"issue":"1","key":"399_CR85","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-016-0995-5","volume":"165","author":"RT Rockafellar","year":"2017","unstructured":"Rockafellar, R.T., Wets, R.J.: Stochastic variational inequalities: single-stage to multistage. Math. Program. 165(1), 331\u2013360 (2017). https:\/\/doi.org\/10.1007\/s10107-016-0995-5","journal-title":"Math. Program."},{"key":"399_CR86","doi-asserted-by":"crossref","unstructured":"Rockafellar, T.R., Wets, R.J.-B.: Variational Analysis. Springer, (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"399_CR87","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A..X.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, (2009)","DOI":"10.1137\/1.9780898718751"},{"key":"399_CR88","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: The Elements of Statistical Learning vol. 1. Springer, (2001)","DOI":"10.1007\/978-0-387-21606-5_1"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00399-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00399-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00399-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T02:27:32Z","timestamp":1676255252000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00399-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":88,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["399"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00399-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"2 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}