{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T02:12:18Z","timestamp":1771294338647,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T00:00:00Z","timestamp":1681084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T00:00:00Z","timestamp":1681084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10589-023-00472-5","type":"journal-article","created":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T20:25:33Z","timestamp":1681158333000},"page":"653-679","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3229-3499","authenticated-orcid":false,"given":"Erfan","family":"Yazdandoost Hamedani","sequence":"first","affiliation":[]},{"given":"Afrooz","family":"Jalilzadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,10]]},"reference":[{"key":"472_CR1","unstructured":"Allen-Zhu, Z., Yuan, Y.: Improved svrg for non-strongly-convex or sum-of-non-convex objectives. In: International conference on machine learning, pp. 1080\u20131089 (2016)"},{"key":"472_CR2","first-page":"10","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J., Lafferty, J.: Clustering with bregman divergences. J. Mach. Learn. Res. 6, 10 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"472_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1\u20132","key":"472_CR4","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":"472_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10107-017-1161-4","volume":"165","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Accelerated schemes for a class of variational inequalities. Math. Program. 165(1), 113\u2013149 (2017)","journal-title":"Math. Program."},{"key":"472_CR6","unstructured":"Dang, C., Lan, G.: Randomized first-order methods for saddle point optimization. http:\/\/arxiv.org\/abs\/1409.8625 (2014)"},{"key":"472_CR7","first-page":"1646","volume":"27","author":"A Defazio","year":"2014","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: a fast incremental gradient method with support for non-strongly convex composite objectives. Adv. Neural Inf. Process. Syst. 27, 1646\u20131654 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"472_CR8","first-page":"9882","volume":"45","author":"AM Devraj","year":"2019","unstructured":"Devraj, A.M., Chen, J.: Stochastic variance reduced primal dual algorithms for empirical composition optimization. Adv. Neural Inf. Process. Syst. 45, 9882\u20139892 (2019)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"472_CR9","unstructured":"Du, S.S., Hu, W.: Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity. http:\/\/arxiv.org\/abs\/1802.01504 (2018)"},{"key":"472_CR10","unstructured":"Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm for general convex-concave saddle point problems. http:\/\/arxiv.org\/abs\/1803.01401 (2018)"},{"issue":"2","key":"472_CR11","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-concave saddle point problems. SIAM J. Optim. 31(2), 1299\u20131329 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"472_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10589-014-9723-3","volume":"61","author":"N He","year":"2015","unstructured":"He, N., Juditsky, A., Nemirovski, A.: Mirror prox algorithm for multi-term composite minimization and semi-separable problems. Comput. Optim. Appl. 61(2), 275\u2013319 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"472_CR13","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-concave saddle-point problems. SIAM J. Optim. 26(1), 29\u201356 (2016)","journal-title":"SIAM J. Optim."},{"key":"472_CR14","unstructured":"Hien, L.T.K., Zhao, R., Haskell, W.B.: An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems. http:\/\/arxiv.org\/abs\/1711.03669 (2017)"},{"key":"472_CR15","unstructured":"Jalilzadeh, A., Hamedani, E.Y., Aybat, N.S., Shanbhag, U.V.: A randomized block-coordinate primal-dual method for large-scale saddle point problems. http:\/\/arxiv.org\/abs\/1907.03886 (2019)"},{"key":"472_CR16","first-page":"315","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Adv. Neural Inf. Process. Syst 26, 315\u2013323 (2013)","journal-title":"Adv. Neural Inf. Process. Syst"},{"issue":"1","key":"472_CR17","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."},{"key":"472_CR18","first-page":"149","volume":"30","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A., et al.: First order methods for nonsmooth convex large-scale optimization, ii: utilizing problems structure. Optim. Mach. Learn. 30, 149\u2013183 (2011)","journal-title":"Optim. Mach. Learn."},{"issue":"6","key":"472_CR19","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-concave saddle-point problems. Optim. Methods Softw. 32(6), 1244\u20131272 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"Jan","key":"472_CR20","first-page":"27","volume":"5","author":"GR Lanckriet","year":"2004","unstructured":"Lanckriet, G.R., Cristianini, N., Bartlett, P., Ghaoui, L.E., Jordan, M.I.: Learning the kernel matrix with semidefinite programming. J. Mach. Learn. Res. 5(Jan), 27\u201372 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"472_CR21","first-page":"1159","volume":"45","author":"X Lian","year":"2017","unstructured":"Lian, X., Wang, M., Liu, J.: Finite-sum composition optimization via variance reduced gradient descent. Artif. Intell. Stat. 45, 1159\u20131167 (2017)","journal-title":"Artif. Intell. Stat."},{"issue":"1","key":"472_CR22","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)","journal-title":"Optim. Methods Softw."},{"key":"472_CR23","first-page":"2208","volume":"29","author":"H Namkoong","year":"2016","unstructured":"Namkoong, H., Duchi, J.C.: Stochastic gradient methods for distributionally robust optimization with f-divergences. Adv. Neural Inf. Process. Syst. 29, 2208\u20132216 (2016)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"472_CR24","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 $$\\cal{O} (1\/t)$$ for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"472_CR25","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."},{"issue":"1","key":"472_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"472_CR27","first-page":"1416","volume":"29","author":"B Palaniappan","year":"2016","unstructured":"Palaniappan, B., Bach, F.: Stochastic variance reduction methods for saddle-point problems. Adv. Neural Inf. Process. Syst. 29, 1416\u20131424 (2016)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"472_CR28","first-page":"2663","volume":"25","author":"NL Roux","year":"2012","unstructured":"Roux, N.L., Schmidt, M., Bach, F.R.: A stochastic gradient method with an exponential convergence rate for finite training sets. Adv. Neural Inf. Process. Syst. 25, 2663\u20132671 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"472_CR29","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization (2008). Available at http:\/\/www.mit.edu\/~dimitrib\/PTseng\/papers\/apgm.pdf"},{"key":"472_CR30","unstructured":"Wang, J., Xiao, L.: Exploiting strong convexity from data with primal-dual first-order algorithms. http:\/\/arxiv.org\/abs\/1703.02624 (2017)"},{"key":"472_CR31","unstructured":"Yan, Y., Xu, Y., Lin, Q., Zhang, L., Yang, T.: Stochastic primal-dual algorithms with faster convergence than $$ o (1\/\\sqrt{T})$$ for problems without bilinear structure. http:\/\/arxiv.org\/abs\/1904.10112 (2019)"},{"key":"472_CR32","unstructured":"Zhang, J., Xiao, L.: A composite randomized incremental gradient method. In: International Conference on Machine Learning, pp. 7454\u20137462 (2019)"},{"issue":"2","key":"472_CR33","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-concave saddle-point problems. Math. Op. Res. 47(2), 1443\u20131473 (2022)","journal-title":"Math. Op. Res."},{"key":"472_CR34","doi-asserted-by":"publisher","unstructured":"Chih-Chung, Chang Chih-Jen, Lin LIBSVM ACM Transactions on Intelligent Systems and Technology 2(3) 1\u201327 (2011). https:\/\/doi.org\/10.1145\/1961189.1961199","DOI":"10.1145\/1961189.1961199"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00472-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00472-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00472-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:06:04Z","timestamp":1683788764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00472-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,10]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["472"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00472-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,10]]},"assertion":[{"value":"1 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2023","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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}