{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T09:39:55Z","timestamp":1780565995270,"version":"3.54.1"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["12Y7622N"],"award-info":[{"award-number":["12Y7622N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G081222N"],"award-info":[{"award-number":["G081222N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G033822N"],"award-info":[{"award-number":["G033822N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G0A0920N"],"award-info":[{"award-number":["G0A0920N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP21K17710."],"award-info":[{"award-number":["JP21K17710."]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10107-024-02143-7","type":"journal-article","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T05:29:07Z","timestamp":1730093347000},"page":"433-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient"],"prefix":"10.1007","volume":"213","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7969-8565","authenticated-orcid":false,"given":"Puya","family":"Latafat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6044-0169","authenticated-orcid":false,"given":"Andreas","family":"Themelis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Stella","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4824-7697","authenticated-orcid":false,"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,28]]},"reference":[{"issue":"172","key":"2143_CR1","first-page":"1","volume":"24","author":"A Alacaoglu","year":"2023","unstructured":"Alacaoglu, A., B\u00f6hm, A., Malitsky, Y.: Beyond the golden ratio for variational inequality algorithms. J. Mach. Learn. Res. 24(172), 1\u201333 (2023)","journal-title":"J. Mach. Learn. Res."},{"key":"2143_CR2","doi-asserted-by":"crossref","unstructured":"Altschuler, J.M., Parrilo, P.A.: Acceleration by stepsize hedging II: silver stepsize schedule for smooth convex optimization. arXiv preprint arXiv:2309.16530 (2023)","DOI":"10.1007\/s10107-024-02164-2"},{"key":"2143_CR3","unstructured":"Attouch, H., Bo\u0163, R.I., Nguyen, D.K.: Fast convex optimization via closed-loop time scaling of gradient dynamics. arXiv preprint arXiv:2301.00701 (2023)"},{"issue":"2","key":"2143_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF03007664","volume":"26","author":"JB Baillon","year":"1977","unstructured":"Baillon, J.B., Haddad, G.: Quelques propri\u00e9t\u00e9s des op\u00e9rateurs angle-born\u00e9s et $$n$$-cycliquement monotones. Israel J. Math. 26(2), 137\u2013150 (1977)","journal-title":"Israel J. Math."},{"issue":"1","key":"2143_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"2143_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics, Springer (2017)"},{"key":"2143_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia, PA (2017)"},{"key":"2143_CR8","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (2016)"},{"key":"2143_CR9","doi-asserted-by":"crossref","unstructured":"Bianchi, P., Hachem, W.: A primal-dual algorithm for distributed optimization. In: IEEE 53rd Annual Conference on Decision and Control (CDC), pp. 4240\u20134245 (2014)","DOI":"10.1109\/CDC.2014.7040050"},{"key":"2143_CR10","unstructured":"B\u00f6hm, A.: Solving nonconvex-nonconcave min-max problems exhibiting weak Minty solutions. arXiv preprint arXiv:2201.12247 (2022)"},{"issue":"4","key":"2143_CR11","doi-asserted-by":"publisher","first-page":"2541","DOI":"10.1137\/120901106","volume":"23","author":"RI Bo\u0163","year":"2013","unstructured":"Bo\u0163, R.I., Hendrich, C.: A Douglas-Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators. SIAM J. Optim. 23(4), 2541\u20132565 (2013)","journal-title":"SIAM J. Optim."},{"key":"2143_CR12","first-page":"1","volume":"24","author":"RI Bo\u0163","year":"2023","unstructured":"Bo\u0163, R.I., Sedlmayer, M., Vuong, P.T.: A relaxed inertial forward-backward-forward algorithm for solving monotone inclusions with application to GANs. J. Mach. Learn. Res. 24, 1\u201337 (2023)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"2143_CR13","doi-asserted-by":"publisher","first-page":"2839","DOI":"10.1137\/17M1120099","volume":"28","author":"LM Brice\u00f1o-Arias","year":"2018","unstructured":"Brice\u00f1o-Arias, L.M., Davis, D.: Forward-backward-half forward algorithm for solving monotone inclusions. SIAM J. Optim. 28(4), 2839\u20132871 (2018)","journal-title":"SIAM J. Optim."},{"key":"2143_CR14","doi-asserted-by":"crossref","unstructured":"Burdakov, O., Dai, Y.H., Huang, N.: Stabilized barzilai-borwein method. J. Comput. Math. 37(6), 916\u2013936 (2019)","DOI":"10.4208\/jcm.1911-m2019-0171"},{"issue":"1","key":"2143_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis"},{"key":"2143_CR16","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 Transact. Intell. Syst. Technol. (TIST) 2, 1\u201327 (2011)","journal-title":"ACM Transact. Intell. Syst. Technol. (TIST)"},{"issue":"3","key":"2143_CR17","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1137\/21M1420319","volume":"32","author":"XK Chang","year":"2022","unstructured":"Chang, X.K., Yang, J., Zhang, H.: Golden ratio primal-dual algorithm with linesearch. SIAM J. Optim. 32(3), 1584\u20131613 (2022)","journal-title":"SIAM J. Optim."},{"key":"2143_CR18","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer New York (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"2","key":"2143_CR19","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 Var. Anal. 20(2), 307\u2013330 (2012)","journal-title":"Set-Valued Var. Anal."},{"issue":"2","key":"2143_CR20","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158(2), 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2143_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005","unstructured":"Dai, Y.H., Fletcher, R.: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100(1), 21\u201347 (2005)","journal-title":"Numer. Math."},{"issue":"4","key":"2143_CR22","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25(4), 829\u2013858 (2017)","journal-title":"Set-Valued Var. Anal."},{"key":"2143_CR23","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s10957-022-02048-5","volume":"194","author":"A De Marchi","year":"2022","unstructured":"De Marchi, A., Themelis, A.: Proximal gradient algorithms under local Lipschitz gradient continuity: a convergence and robustness analysis of PANOC. J. Optim. Theory Appl. 194, 771\u2013794 (2022)","journal-title":"J. Optim. Theory Appl."},{"key":"2143_CR24","unstructured":"Defazio, A., Zhou, B., Xiao, L.: Grad-GradaGrad? A Non-monotone Adaptive Stochastic Gradient Method. arXiv preprint arXiv:2206.06900 (2022)"},{"key":"2143_CR25","unstructured":"Diakonikolas, J., Daskalakis, C., Jordan, M.: Efficient methods for structured nonconvex-nonconcave min-max optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 2746\u20132754. PMLR (2021)"},{"issue":"2","key":"2143_CR26","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.orl.2015.02.001","volume":"43","author":"Y Drori","year":"2015","unstructured":"Drori, Y., Sabach, S., Teboulle, M.: A simple algorithm for a class of nonsmooth convex-concave saddle-point problems. Oper. Res. Lett. 43(2), 209\u2013214 (2015)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2143_CR27","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/18M1168480","volume":"29","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Bianchi, P.: A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions. SIAM J. Optim. 29(1), 100\u2013134 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2143_CR28","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1137\/20M1345062","volume":"31","author":"P Giselsson","year":"2021","unstructured":"Giselsson, P.: Nonlinear forward-backward splitting with projection correction. SIAM J. Optim. 31(3), 2199\u20132226 (2021)","journal-title":"SIAM J. Optim."},{"key":"2143_CR29","unstructured":"Goldstein, T., Li, M., Yuan, X.: Adaptive primal-dual splitting methods for statistical learning and image processing. Adv. Neural Inform. Process. Syst. 28 (2015)"},{"key":"2143_CR30","unstructured":"Goldstein, T., Li, M., Yuan, X., Esser, E., Baraniuk, R.: Adaptive primal-dual hybrid gradient methods for saddle-point problems. arXiv preprint arXiv:1305.0546 (2013)"},{"key":"2143_CR31","unstructured":"Grimmer, B., Shu, K., Wang, A.L.: Accelerated gradient descent via long steps. arXiv preprint arXiv:2309.09961 (2023)"},{"key":"2143_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2001","unstructured":"Hastie, T., Friedman, J., Tibshirani, R.: The Elements of Statistical Learning. Springer, New York (2001)"},{"issue":"1","key":"2143_CR33","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective. SIAM J. Imag. Sci. 5(1), 119\u2013149 (2012)","journal-title":"SIAM J. Imag. Sci."},{"key":"2143_CR34","doi-asserted-by":"crossref","unstructured":"Jezierska, A., Chouzenoux, E., Pesquet, J.C., Talbot, H.: A primal-dual proximal splitting approach for restoring data corrupted with Poisson-Gaussian noise. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1085\u20131088. IEEE (2012)","DOI":"10.1109\/ICASSP.2012.6288075"},{"issue":"6","key":"2143_CR35","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MSP.2014.2377273","volume":"32","author":"N Komodakis","year":"2015","unstructured":"Komodakis, N., Pesquet, J.C.: Playing with duality: an overview of recent primal-dual approaches for solving large-scale optimization problems. IEEE Signal Process. Mag. 32(6), 31\u201354 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"2143_CR36","unstructured":"Latafat, P.: Distributed proximal algorithms for large-scale structured optimization. Ph.D. thesis, KU Leuven (2020)"},{"key":"2143_CR37","doi-asserted-by":"crossref","unstructured":"Latafat, P., Bemporad, A., Patrinos, P.: Plug and play distributed model predictive control with dynamic coupling: a randomized primal-dual proximal algorithm. In: European Control Conference (ECC), pp. 1160\u20131165 (2018)","DOI":"10.23919\/ECC.2018.8550270"},{"issue":"10","key":"2143_CR38","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)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"2143_CR39","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10589-017-9909-6","volume":"68","author":"P Latafat","year":"2017","unstructured":"Latafat, P., Patrinos, P.: Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators. Comput. Optim. Appl. 68(1), 57\u201393 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"2143_CR40","doi-asserted-by":"crossref","unstructured":"Latafat, P., Patrinos, P.: Primal-dual proximal algorithms for structured convex optimization: A unifying framework. In: P.\u00a0Giselsson, A.\u00a0Rantzer (eds.) Large-Scale and Distributed Optimization, pp. 97\u2013120. Springer International Publishing (2018)","DOI":"10.1007\/978-3-319-97478-1_5"},{"key":"2143_CR41","doi-asserted-by":"crossref","unstructured":"Latafat, P., Stella, L., Patrinos, P.: New primal-dual proximal algorithm for distributed optimization. In: 55th IEEE Conference on Decision and Control (CDC), pp. 1959\u20131964 (2016)","DOI":"10.1109\/CDC.2016.7798551"},{"issue":"3","key":"2143_CR42","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1137\/21M140376X","volume":"32","author":"P Latafat","year":"2022","unstructured":"Latafat, P., Themelis, A., Ahookhosh, M., Patrinos, P.: Bregman Finito\/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity. SIAM J. Optim. 32(3), 2230\u20132262 (2022)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2143_CR43","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-020-01599-7","volume":"193","author":"P Latafat","year":"2022","unstructured":"Latafat, P., Themelis, A., Patrinos, P.: Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems. Math. Program. 193(1), 195\u2013224 (2022)","journal-title":"Math. Program."},{"key":"2143_CR44","unstructured":"Latafat, P., Themelis, A., Villa, S., Patrinos, P.: On the convergence of proximal gradient methods for convex simple bilevel optimization. arXiv preprint arXiv:2305.03559 (2023)"},{"key":"2143_CR45","unstructured":"Li, X., Orabona, F.: On the convergence of stochastic gradient descent with adaptive stepsizes. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 983\u2013992. PMLR (2019)"},{"issue":"1","key":"2143_CR46","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)","journal-title":"Math. Program."},{"key":"2143_CR47","unstructured":"Malitsky, Y., Mishchenko, K.: Adaptive gradient descent without descent. In: Proceedings of the 37th International Conference on Machine Learning, vol. 119, pp. 6702\u20136712. PMLR (2020)"},{"key":"2143_CR48","unstructured":"Malitsky, Y., Mishchenko, K.: Adaptive proximal gradient method for convex optimization. arXiv preprint arXiv:2308.02261 (2023)"},{"issue":"1","key":"2143_CR49","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/16M1092015","volume":"28","author":"Y Malitsky","year":"2018","unstructured":"Malitsky, Y., Pock, T.: A first-order primal-dual algorithm with linesearch. SIAM J. Optim. 28(1), 411\u2013432 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2143_CR50","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1137\/18M1207260","volume":"30","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y., Tam, M.K.: A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 30(2), 1451\u20131472 (2020)","journal-title":"SIAM J. Optim."},{"key":"2143_CR51","unstructured":"Marumo, N., Takeda, A.: Parameter-free accelerated gradient descent for nonconvex minimization (2022)"},{"issue":"1","key":"2143_CR52","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"2143_CR53","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"2143_CR54","unstructured":"Pedregosa, F., Gidel, G.: Adaptive three operator splitting. In: International Conference on Machine Learning, pp. 4085\u20134094. PMLR (2018)"},{"key":"2143_CR55","unstructured":"Pethick, T., Latafat, P., Patrinos, P., Fercoq, O., Cevher, V.: Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems. In: International Conference on Learning Representations (2022)"},{"issue":"3","key":"2143_CR56","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13(3), 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"key":"2143_CR57","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"2143_CR58","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer (2009)"},{"issue":"3","key":"2143_CR59","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/s10957-019-01601-z","volume":"184","author":"EK Ryu","year":"2020","unstructured":"Ryu, E.K., V\u0169, B.C.: Finding the forward-Douglas-Rachford-forward method. J. Optim. Theory Appl. 184(3), 858\u2013876 (2020)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2143_CR60","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward-backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27(4), 2153\u20132181 (2017)","journal-title":"SIAM J. Optim."},{"key":"2143_CR61","doi-asserted-by":"crossref","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press (2012)","DOI":"10.7551\/mitpress\/8996.001.0001"},{"key":"2143_CR62","unstructured":"Tan, C., Ma, S., Dai, Y.H., Qian, Y.: Barzilai-Borwein step size for stochastic gradient descent. Adv. Neural Inform. Process. Syst. 29 (2016)"},{"key":"2143_CR63","doi-asserted-by":"crossref","unstructured":"Teboulle, M., Vaisbourd, Y.: An elementary approach to tight worst case complexity analysis of gradient based methods. Mathematical Programming pp. 1\u201334 (2022)","DOI":"10.1007\/s10107-022-01899-0"},{"issue":"1","key":"2143_CR64","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11590-019-01511-z","volume":"14","author":"DV Thong","year":"2020","unstructured":"Thong, D.V., Van Hieu, D., Rassias, T.M.: Self adaptive inertial subgradient extragradient algorithms for solving pseudomonotone variational inequality problems. Optim. Lett. 14(1), 115\u2013144 (2020)","journal-title":"Optim. Lett."},{"key":"2143_CR65","first-page":"6171","volume":"34","author":"ML Vladarean","year":"2021","unstructured":"Vladarean, M.L., Malitsky, Y., Cevher, V.: A first-order primal-dual method with adaptivity to local smoothness. Adv. Neural. Inf. Process. Syst. 34, 6171\u20136182 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"3","key":"2143_CR66","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"BC V\u0169","year":"2013","unstructured":"V\u0169, B.C.: A splitting algorithm for dual monotone inclusions involving cocoercive operators. Adv. Comput. Math. 38(3), 667\u2013681 (2013)","journal-title":"Adv. Comput. Math."},{"key":"2143_CR67","unstructured":"Ward, R., Wu, X., Bottou, L.: AdaGrad stepsizes: Sharp convergence over nonconvex landscapes. In: K.\u00a0Chaudhuri, R.\u00a0Salakhutdinov (eds.) Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a097, pp. 6677\u20136686. PMLR (2019)"},{"issue":"3","key":"2143_CR68","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1007\/s10915-018-0680-3","volume":"76","author":"M Yan","year":"2018","unstructured":"Yan, M.: A new primal-dual algorithm for minimizing the sum of three functions with a linear operator. J. Sci. Comput. 76(3), 1698\u20131717 (2018)","journal-title":"J. Sci. Comput."},{"issue":"5","key":"2143_CR69","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1080\/00036811.2019.1634257","volume":"100","author":"J Yang","year":"2021","unstructured":"Yang, J.: Self-adaptive inertial subgradient extragradient algorithm for solving pseudomonotone variational inequalities. Appl. Anal. 100(5), 1067\u20131078 (2021)","journal-title":"Appl. Anal."},{"issue":"1","key":"2143_CR70","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10957-018-1351-0","volume":"179","author":"J Yang","year":"2018","unstructured":"Yang, J., Liu, H.: A modified projected gradient method for monotone variational inequalities. J. Optim. Theory Appl. 179(1), 197\u2013211 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"2143_CR71","first-page":"19743","volume":"34","author":"A Yurtsever","year":"2021","unstructured":"Yurtsever, A., Gu, A., Sra, S.: Three operator splitting with subgradients, stochastic gradients, and adaptive learning rates. Adv. Neural. Inf. Process. Syst. 34, 19743\u201319756 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02143-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02143-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02143-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T12:04:21Z","timestamp":1756901061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02143-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,28]]},"references-count":71,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2143"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02143-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,28]]},"assertion":[{"value":"13 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2024","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 Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}