{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T06:01:13Z","timestamp":1775628073296,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["30452698"],"award-info":[{"award-number":["30452698"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FWO","award":["G0C0623N"],"award-info":[{"award-number":["G0C0623N"]}]},{"name":"FWO","award":["G0A0920N"],"award-info":[{"award-number":["G0A0920N"]}]},{"name":"FWO","award":["G086518N"],"award-info":[{"award-number":["G086518N"]}]},{"name":"FWO","award":["G086318N"],"award-info":[{"award-number":["G086318N"]}]},{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science London","doi-asserted-by":"publisher","award":["JP21K17710"],"award-info":[{"award-number":["JP21K17710"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["953348"],"award-info":[{"award-number":["953348"]}],"id":[{"id":"10.13039\/100010665","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":[[2024,5]]},"DOI":"10.1007\/s10589-023-00550-8","type":"journal-article","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T08:01:41Z","timestamp":1711699301000},"page":"71-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4522-1280","authenticated-orcid":false,"given":"Pourya","family":"Behmandpoor","sequence":"first","affiliation":[]},{"given":"Puya","family":"Latafat","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Themelis","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Moonen","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"issue":"1","key":"550_CR1","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/19M1264783","volume":"31","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima. SIAM J. Optim. 31(1), 653\u2013685 (2021). https:\/\/doi.org\/10.1137\/19M1264783","journal-title":"SIAM J. Optim."},{"issue":"1","key":"550_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10589-013-9615-y","volume":"58","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Belyakov, A., Dontchev, A.L., L\u00f3pez, M.: Local convergence of quasi-Newton methods under metric regularity. Comput. Optim. Appl. 58(1), 225\u2013247 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"550_CR3","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"550_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"550_CR5","doi-asserted-by":"crossref","unstructured":"Bengio, Y.: Practical recommendations for gradient-based training of deep architectures. Neural Networks: Tricks of the Trade: Second Edition, pp. 437\u2013478 (2012)","DOI":"10.1007\/978-3-642-35289-8_26"},{"key":"550_CR6","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (2016)"},{"issue":"3","key":"550_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S1052623497331063","volume":"10","author":"DP Bertsekas","year":"2000","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Gradient convergence in gradient methods with errors. SIAM J. Optim. 10(3), 627\u2013642 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"550_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/040615961","volume":"18","author":"D Blatt","year":"2007","unstructured":"Blatt, D., Hero, A.O., Gauchman, H.: A convergent incremental gradient method with a constant step size. SIAM J. Optim. 18(1), 29\u201351 (2007)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"550_CR9","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"550_CR10","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"550_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"550_CR12","doi-asserted-by":"crossref","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28(3), 2131\u20132151 (2018)","DOI":"10.1137\/17M1138558"},{"key":"550_CR13","unstructured":"Cai, X., Lin, C.Y., Diakonikolas, J.: Empirical risk minimization with shuffled SGD: a primal-dual perspective and improved bounds. arXiv preprint arXiv:2306.12498 (2023)"},{"key":"550_CR14","unstructured":"Cai, X., Song, C., Wright, S., Diakonikolas, J.: Cyclic block coordinate descent with variance reduction for composite nonconvex optimization. In: International Conference on Machine Learning, pp. 3469\u20133494. PMLR (2023)"},{"issue":"4","key":"550_CR15","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"EJ Candes","year":"2015","unstructured":"Candes, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via Wirtinger flow: theory and algorithms. IEEE Trans. Inf. Theory 61(4), 1985\u20132007 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"550_CR16","unstructured":"Cha, J., Lee, J., Yun, C.: Tighter lower bounds for shuffling SGD: Random permutations and beyond. In: International Conference on Machine Learning, pp. 3855\u20133912. PMLR (2023)"},{"key":"550_CR17","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 Trans. Intell. Syst. Technol. (TIST) 2, 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"3","key":"550_CR18","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"key":"550_CR19","unstructured":"Davis, D., Drusvyatskiy, D., MacPhee, K.J.: Stochastic model-based minimization under high-order growth. arXiv preprint arXiv:1807.00255 (2018)"},{"key":"550_CR20","doi-asserted-by":"crossref","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(3), 771\u2013794 (2022)","DOI":"10.1007\/s10957-022-02048-5"},{"key":"550_CR21","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Advances in Neural Information Processing Systems, pp. 1646\u20131654 (2014)"},{"key":"550_CR22","unstructured":"Defazio, A., Domke, J.: Finito: A faster, permutable incremental gradient method for big data problems. In: International Conference on Machine Learning, pp. 1125\u20131133 (2014)"},{"issue":"126","key":"550_CR23","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1090\/S0025-5718-1974-0343581-1","volume":"28","author":"JE Dennis","year":"1974","unstructured":"Dennis, J.E., Mor\u00e9, J.J.: A characterization of superlinear convergence and its application to quasi-newton methods. Math. Comput. 28(126), 549\u2013560 (1974)","journal-title":"Math. Comput."},{"key":"550_CR24","doi-asserted-by":"crossref","unstructured":"Dennis, J.E., Jr., Mor\u00e9, J.J.: Quasi-Newton methods, motivation and theory. SIAM Rev. 19(1), 46\u201389 (1977)","DOI":"10.1137\/1019005"},{"key":"550_CR25","unstructured":"Dragomir, R.A., Even, M., Hendrikx, H.: Fast stochastic Bregman gradient methods: sharp analysis and variance reduction. In: International Conference on Machine Learning, pp. 2815\u20132825. PMLR (2021)"},{"issue":"3","key":"550_CR26","first-page":"471","volume":"8","author":"JC Duchi","year":"2019","unstructured":"Duchi, J.C., Ruan, F.: Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval. Inf. Inference J. IMA 8(3), 471\u2013529 (2019)","journal-title":"Inf. Inference J. IMA"},{"key":"550_CR27","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, II (2003)"},{"key":"550_CR28","unstructured":"Fang, C., Li, C.J., Lin, Z., Zhang, T.: Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"550_CR29","unstructured":"Ge, R., Li, Z., Wang, W., Wang, X.: Stabilized SVRG: simple variance reduction for nonconvex optimization. In: Conference on Learning Theory, pp. 1394\u20131448. PMLR (2019)"},{"issue":"4","key":"550_CR30","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"550_CR31","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":"550_CR32","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-019-01440-w","volume":"186","author":"M G\u00fcrb\u00fczbalaban","year":"2021","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., Parrilo, P.A.: Why random reshuffling beats stochastic gradient descent. Math. Program. 186, 49\u201384 (2021)","journal-title":"Math. Program."},{"key":"550_CR33","doi-asserted-by":"crossref","unstructured":"Hanzely, F., Richt\u00e1rik, P.: Fastest rates for stochastic mirror descent methods. Comput. Optim. Appl. 1\u201350 (2021)","DOI":"10.1007\/s10589-021-00284-5"},{"key":"550_CR34","unstructured":"Haochen, J., Sra, S.: Random shuffling beats SGD after finite epochs. In: International Conference on Machine Learning, pp. 2624\u20132633. PMLR (2019)"},{"key":"550_CR35","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)"},{"key":"550_CR36","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":"3","key":"550_CR37","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/j.na.2011.07.031","volume":"75","author":"C Kan","year":"2012","unstructured":"Kan, C., Song, W.: The Moreau envelope function and proximal mapping in the sense of the Bregman distance. Nonlinear Anal. Theory Methods Appl. 75(3), 1385\u20131399 (2012). https:\/\/doi.org\/10.1016\/j.na.2011.07.031","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"issue":"3","key":"550_CR38","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in $$o$$-minimal structures. Annales de l\u2019institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019institut Fourier"},{"key":"550_CR39","doi-asserted-by":"crossref","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)","DOI":"10.1137\/21M140376X"},{"key":"550_CR40","doi-asserted-by":"crossref","unstructured":"Latafat, P., Themelis, A., Patrinos, P.: Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems. Math. Program. 1\u201330 (2021)","DOI":"10.1007\/s10107-020-01599-7"},{"key":"550_CR41","unstructured":"Li, Z., Richt\u00e1rik, P.: ZeroSARAH: efficient nonconvex finite-sum optimization with zero full gradient computation. arXiv preprint arXiv:2103.01447 (2021)"},{"issue":"1","key":"550_CR42","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R.M., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"550_CR43","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25(2), 829\u2013855 (2015)","journal-title":"SIAM J. Optim."},{"key":"550_CR44","first-page":"17309","volume":"33","author":"K Mishchenko","year":"2020","unstructured":"Mishchenko, K., Khaled, A., Richt\u00e1rik, P.: Random reshuffling: simple analysis with vast improvements. Adv. Neural Inf. Process. Syst. 33, 17309\u201317320 (2020)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"550_CR45","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1137\/17M1122943","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., Eisen, M., Ribeiro, A.: IQN: an incremental quasi-Newton method with local superlinear convergence rate. SIAM J. Optim. 28(2), 1670\u20131698 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"550_CR46","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/16M1101702","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., G\u00fcrb\u00fczbalaban, M., Ribeiro, A.: Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate. SIAM J. Optim. 28(2), 1420\u20131447 (2018)","journal-title":"SIAM J. Optim."},{"key":"550_CR47","unstructured":"Moritz, P., Nishihara, R., Jordan, M.: A linearly-convergent stochastic L-BFGS algorithm. In: Artificial Intelligence and Statistics, pp. 249\u2013258. PMLR (2016)"},{"issue":"1","key":"550_CR48","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/120894464","volume":"24","author":"A Nedic","year":"2014","unstructured":"Nedic, A., Lee, S.: On stochastic subgradient mirror-descent algorithm with weighted averaging. SIAM J. Optim. 24(1), 84\u2013107 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"550_CR49","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."},{"key":"550_CR50","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: a basic course, vol. 137. Springer Science & Business Media (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"key":"550_CR51","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. In: International Conference on Machine Learning, pp. 2613\u20132621. PMLR (2017)"},{"key":"550_CR52","doi-asserted-by":"crossref","unstructured":"Pas, P., Schuurmans, M., Patrinos, P.: Alpaqa: a matrix-free solver for nonlinear MPC and large-scale nonconvex optimization. In: 2022 European Control Conference (ECC), pp. 417\u2013422. IEEE (2022)","DOI":"10.23919\/ECC55457.2022.9838172"},{"key":"550_CR53","first-page":"110","volume":"21","author":"NH Pham","year":"2020","unstructured":"Pham, N.H., Nguyen, L.M., Phan, D.T., Tran-Dinh, Q.: ProxSARAH: an efficient algorithmic framework for stochastic composite nonconvex optimization. J. Mach. Learn. Res. 21, 110\u20131 (2020)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"550_CR54","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-013-0053-8","volume":"5","author":"B Recht","year":"2013","unstructured":"Recht, B., R\u00e9, C.: Parallel stochastic gradient algorithms for large-scale matrix completion. Math. Program. Comput. 5(2), 201\u2013226 (2013)","journal-title":"Math. Program. Comput."},{"key":"550_CR55","doi-asserted-by":"crossref","unstructured":"Reddi, S.J., Hefny, A., Sra, S., Poczos, B., Smola, A.J.: Stochastic variance reduction for nonconvex optimization. In: International Conference on Machine Learning, pp. 314\u2013323 (2016)","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"550_CR56","unstructured":"Reddi, S.J., Sra, S., Poczos, B., Smola, A.J.: Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization. In: Advances in Neural Information Processing Systems, pp. 1145\u20131153 (2016)"},{"key":"550_CR57","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"550_CR58","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational analysis, vol. 317. Springer Science & Business Media (2009)"},{"key":"550_CR59","unstructured":"Rodomanov, A., Kropotov, D.: A superlinearly-convergent proximal Newton-type method for the optimization of finite sums. In: International Conference on Machine Learning, pp. 2597\u20132605. PMLR (2016)"},{"key":"550_CR60","unstructured":"Sadeghi, H., Giselsson, P.: Hybrid acceleration scheme for variance reduced stochastic optimization algorithms. arXiv preprint arXiv:2111.06791 (2021)"},{"issue":"1","key":"550_CR61","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1), 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"550_CR62","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14(Feb), 567\u2013599 (2013)"},{"issue":"2","key":"550_CR63","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/moor.25.2.214.12222","volume":"25","author":"MV Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math. Oper. Res. 25(2), 214\u2013230 (2000)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"550_CR64","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s10208-017-9365-9","volume":"18","author":"J Sun","year":"2018","unstructured":"Sun, J., Qu, Q., Wright, J.: A geometric analysis of phase retrieval. Found. Comput. Math. 18(5), 1131\u20131198 (2018)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"550_CR65","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 170(1), 67\u201396 (2018)","journal-title":"Math. Program."},{"key":"550_CR66","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-030-25939-6_15","volume-title":"Splitting Algorithms, Modern Operator Theory, and Applications","author":"A Themelis","year":"2019","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact Newton method. In: Bauschke, H.H., Burachik, R.S., Luke, D.R. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer International Publishing, Cham (2019)"},{"key":"550_CR67","doi-asserted-by":"crossref","unstructured":"Themelis, A., Patrinos, P.: SuperMann: a superlinearly convergent algorithm for finding fixed points of nonexpansive operators. IEEE Trans. Autom. Control 64(12), 4875\u20134890 (2019)","DOI":"10.1109\/TAC.2019.2906393"},{"issue":"3","key":"550_CR68","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"550_CR69","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1137\/16M1094415","volume":"28","author":"ND Vanli","year":"2018","unstructured":"Vanli, N.D., Gurbuzbalaban, M., Ozdaglar, A.: Global convergence rate of proximal incremental aggregated gradient methods. SIAM J. Optim. 28(2), 1282\u20131300 (2018)","journal-title":"SIAM J. Optim."},{"key":"550_CR70","unstructured":"Wang, Z., Ji, K., Zhou, Y., Liang, Y., Tarokh, V.: Spiderboost and momentum: faster variance reduction algorithms. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"550_CR71","doi-asserted-by":"crossref","unstructured":"Yang, M., Milzarek, A., Wen, Z., Zhang, T.: A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization. Math. Program. 1\u201347 (2021)","DOI":"10.1007\/s10107-021-01629-y"},{"key":"550_CR72","doi-asserted-by":"crossref","unstructured":"Yu, P., Li, G., Pong, T.K.: Kurdyka-\u0141ojasiewicz exponent via inf-projection. Found. Comput. Math. 1\u201347 (2021)","DOI":"10.1007\/s10208-021-09528-6"},{"issue":"1","key":"550_CR73","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/moor.2019.1047","volume":"46","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Dai, Y.H., Guo, L., Peng, W.: Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions. Math. Oper. Res. 46(1), 61\u201381 (2021)","journal-title":"Math. Oper. Res."},{"key":"550_CR74","doi-asserted-by":"crossref","unstructured":"Zhang, J., Liu, H., So, A.M.C., Ling, Q.: Variance-reduced stochastic quasi-Newton methods for decentralized learning: Part I (2022)","DOI":"10.1109\/TSP.2023.3240652"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00550-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00550-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00550-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T10:49:13Z","timestamp":1714128553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00550-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,29]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["550"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00550-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,29]]},"assertion":[{"value":"11 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 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 competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}