{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:59:35Z","timestamp":1778673575531,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"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":[[2024,4]]},"DOI":"10.1007\/s10589-023-00541-9","type":"journal-article","created":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T19:02:01Z","timestamp":1701975721000},"page":"1059-1098","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Bregman\u2013Kaczmarz method for nonlinear systems of equations"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2268-9780","authenticated-orcid":false,"given":"Robert","family":"Gower","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7419-769X","authenticated-orcid":false,"given":"Dirk A.","family":"Lorenz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8501-5556","authenticated-orcid":false,"given":"Maximilian","family":"Winkler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,7]]},"reference":[{"issue":"1","key":"541_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1022631928592","volume":"92","author":"Y Alber","year":"1997","unstructured":"Alber, Y., Butnariu, D.: Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces. J. Optim. Theory Appl. 92(1), 33\u201361 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"541_CR2","first-page":"1715","volume":"14","author":"R Arora","year":"2013","unstructured":"Arora, R., Gupta, M.R., Kapila, A., Fazel, M.: Similarity-based clustering by left-stochastic matrix factorization. J. Mach. Learn. Res. 14(1), 1715\u20131746 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"12","key":"541_CR3","doi-asserted-by":"publisher","first-page":"7717","DOI":"10.1109\/TNNLS.2021.3087480","volume":"33","author":"N Azizan","year":"2021","unstructured":"Azizan, N., Lale, S., Hassibi, B.: Stochastic mirror descent on overparameterized nonlinear models. IEEE Trans. Neural Netw. Learn. Systems 33(12), 7717\u20137727 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn. Systems"},{"issue":"2","key":"541_CR4","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/S0363012902407120","volume":"42","author":"HH Bauschke","year":"2003","unstructured":"Bauschke, H.H., Borwein, J.M., Combettes, P.L.: Bregman monotone optimization algorithms. SIAM J. Control. Optim. 42(2), 596\u2013636 (2003)","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"541_CR5","first-page":"27","volume":"4","author":"HH Bauschke","year":"1997","unstructured":"Bauschke, H.H., Borwein, J.M., et al.: Legendre functions and the method of random Bregman projections. J. Convex Anal. 4(1), 27\u201367 (1997)","journal-title":"J. Convex Anal."},{"issue":"4","key":"541_CR6","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S1052623402410557","volume":"13","author":"HH Bauschke","year":"2003","unstructured":"Bauschke, H.H., Combettes, P.L.: Iterating Bregman retractions. SIAM J. Optim. 13(4), 1159\u20131173 (2003)","journal-title":"SIAM J. Optim."},{"key":"541_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces, vol. 408. Springer, Berlin (2011)"},{"key":"541_CR8","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"issue":"2","key":"541_CR9","doi-asserted-by":"publisher","first-page":"A1111","DOI":"10.1137\/141000439","volume":"37","author":"J-D Benamou","year":"2015","unstructured":"Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., Peyr\u00e9, G.: Iterative Bregman projections for regularized transportation problems. SIAM J. Sci. Comput. 37(2), A1111\u2013A1138 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"10","key":"541_CR10","doi-asserted-by":"publisher","first-page":"104010","DOI":"10.1088\/0266-5611\/28\/10\/104010","volume":"28","author":"RI Bo\u0163","year":"2012","unstructured":"Bo\u0163, R.I., Hein, T.: Iterative regularization with a general penalty term-theory and application to L1 and TV regularization. Inverse Prob. 28(10), 104010 (2012)","journal-title":"Inverse Prob."},{"issue":"3","key":"541_CR11","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"541_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","volume":"3","author":"P Brucker","year":"1984","unstructured":"Brucker, P.: An O(n) algorithm for quadratic knapsack problems. Oper. Res. Lett. 3(3), 163\u2013166 (1984)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"541_CR13","first-page":"35","volume":"10","author":"D Butnariu","year":"2003","unstructured":"Butnariu, D., Iusem, A.N., Zalinescu, C.: On uniform convexity, total convexity and convergence of the proximal point and outer Bregman projection algorithm in Banach spaces. J. Convex Anal. 10(1), 35\u201362 (2003)","journal-title":"J. Convex Anal."},{"key":"541_CR14","first-page":"69","volume-title":"Studies in computational mathematics","author":"D Butnariu","year":"2001","unstructured":"Butnariu, D., Resmerita, E.: The outer Bregman projection method for stochastic feasibility problems in Banach spaces. In: Studies in computational mathematics, vol. 8, pp. 69\u201386. Elsevier, Amsterdam (2001)"},{"key":"541_CR15","doi-asserted-by":"crossref","unstructured":"Butnariu, D., Resmerita, E.: Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces. In Abstract and Applied Analysis, volume 2006. Hindawi, (2006)","DOI":"10.1155\/AAA\/2006\/84919"},{"key":"541_CR16","first-page":"101","volume-title":"Studies in computational mathematics","author":"Y Censor","year":"2001","unstructured":"Censor, Y., Elfving, T., Herman, G.: Averaging strings of sequential iterations for convex feasibility problems. In: Studies in computational mathematics, vol. 8, pp. 101\u2013113. Elsevier, Amsterdam (2001)"},{"issue":"3","key":"541_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00934676","volume":"34","author":"Y Censor","year":"1981","unstructured":"Censor, Y., Lent, A.: An iterative row-action method for interval convex programming. J. Optim. Theory Appl. 34(3), 321\u2013353 (1981)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"541_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/02331939608844225","volume":"37","author":"Y Censor","year":"1996","unstructured":"Censor, Y., Reich, S.: Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization. Optimization 37(4), 323\u2013339 (1996)","journal-title":"Optimization"},{"issue":"2","key":"541_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0165-1684(89)90092-3","volume":"16","author":"AE Cetin","year":"1989","unstructured":"Cetin, A.E.: Reconstruction of signals from Fourier transform samples. Signal Process. 16(2), 129\u2013148 (1989)","journal-title":"Signal Process."},{"issue":"12","key":"541_CR20","doi-asserted-by":"publisher","first-page":"2621","DOI":"10.1109\/78.107412","volume":"39","author":"AE Cetin","year":"1991","unstructured":"Cetin, A.E.: An iterative algorithm for signal reconstruction from bispectrum. IEEE Trans. Signal Process. 39(12), 2621\u20132628 (1991)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"541_CR21","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/060649021","volume":"29","author":"IS Dhillon","year":"2008","unstructured":"Dhillon, I.S., Tropp, J.A.: Matrix nearness problems with Bregman divergences. SIAM J. Matrix Anal. Appl. 29(4), 1120\u20131146 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"541_CR22","unstructured":"Doikov, N., Nesterov, Y.: Gradient regularization of Newton method with Bregman distances. arXiv preprint arXiv:2112.02952, (2021)"},{"key":"541_CR23","unstructured":"D\u2019Orazio, R., Loizou, N., Laradji, I., Mitliagkas, I.: Stochastic mirror descent: convergence analysis and adaptive variants via the mirror stochastic Polyak stepsize. arXiv preprint arXiv:2110.15412, (2021)"},{"key":"541_CR24","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the $$\\ell _1$$-ball for learning in high dimensions. In: Proceedings of the 25th international conference on Machine learning, pp. 272\u2013279, (2008)","DOI":"10.1145\/1390156.1390191"},{"issue":"6","key":"541_CR25","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1109\/TIT.2003.811927","volume":"49","author":"AA Fedotov","year":"2003","unstructured":"Fedotov, A.A., Harremo\u00ebs, P., Topsoe, F.: Refinements of Pinsker\u2019s inequality. IEEE Trans. Inf. Theory 49(6), 1491\u20131498 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"541_CR26","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1137\/0322061","volume":"22","author":"EM Gafni","year":"1984","unstructured":"Gafni, E.M., Bertsekas, D.P.: Two-metric projection methods for constrained optimization. SIAM J. Control. Optim. 22(6), 936\u2013964 (1984)","journal-title":"SIAM J. Control. Optim."},{"key":"541_CR27","unstructured":"Gower, R.\u00a0M., Blondel, M., Gazagnadou, N., Pedregosa, F.: Cutting some slack for SGD with adaptive Polyak stepsizes. arXiv:2202.12328 (2022)"},{"key":"541_CR28","doi-asserted-by":"publisher","first-page":"113211","DOI":"10.1016\/j.cam.2020.113211","volume":"385","author":"R Gu","year":"2021","unstructured":"Gu, R., Han, B., Tong, S., Chen, Y.: An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty. J. Comput. Appl. Math. 385, 113211 (2021)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"541_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s002110050158","volume":"72","author":"M Hanke","year":"1995","unstructured":"Hanke, M., Neubauer, A., Scherzer, O.: A convergence analysis of the Landweber iteration for nonlinear ill-posed problems. Numer. Math. 72(1), 21\u201337 (1995)","journal-title":"Numer. Math."},{"issue":"3","key":"541_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/02331939708844339","volume":"41","author":"NA Iusem","year":"1997","unstructured":"Iusem, N.A., Solodov, V.M.: Newton-type methods with generalized distances for constrained optimization. Optimization 41(3), 257\u2013278 (1997)","journal-title":"Optimization"},{"key":"541_CR31","doi-asserted-by":"crossref","unstructured":"Jarman, B., Yaniv, Y., Needell, D.: Online signal recovery via heavy ball Kaczmarz. arXiv preprint arXiv:2211.06391 (2022)","DOI":"10.1109\/IEEECONF56349.2022.10052070"},{"issue":"10","key":"541_CR32","doi-asserted-by":"publisher","first-page":"104005","DOI":"10.1088\/0266-5611\/32\/10\/104005","volume":"32","author":"Q Jin","year":"2016","unstructured":"Jin, Q.: Landweber-Kaczmarz method in Banach spaces with inexact inner solvers. Inverse Prob. 32(10), 104005 (2016)","journal-title":"Inverse Prob."},{"issue":"6","key":"541_CR33","doi-asserted-by":"publisher","first-page":"065010","DOI":"10.1088\/1361-6420\/accd8e","volume":"39","author":"Q Jin","year":"2023","unstructured":"Jin, Q., Lu, X., Zhang, L.: Stochastic mirror descent method for linear ill-posed problems in banach spaces. Inverse Prob. 39(6), 065010 (2023)","journal-title":"Inverse Prob."},{"issue":"8","key":"541_CR34","doi-asserted-by":"publisher","first-page":"085011","DOI":"10.1088\/0266-5611\/29\/8\/085011","volume":"29","author":"Q Jin","year":"2013","unstructured":"Jin, Q., Wang, W.: Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals. Inverse Prob. 29(8), 085011 (2013)","journal-title":"Inverse Prob."},{"key":"541_CR35","unstructured":"Kaczmarz, S.: Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bull. Internat. Acad. Polon. Sci. Lettres A, pp. 355\u2013357 (1937)"},{"key":"541_CR36","unstructured":"Kostic, V., Salzo, S.: The method of Bregman projections in deterministic and stochastic convex feasibility problems. arXiv preprint arXiv:2101.01704 (2021)"},{"key":"541_CR37","unstructured":"Lin, T., Ho, N., Jordan, M.: On efficient optimal transport: an analysis of greedy and accelerated mirror descent algorithms. In: International conference on machine learning, pp. 3982\u20133991. PMLR (2019)"},{"key":"541_CR38","unstructured":"Loizou, N., Vaswani, S., Laradji, I.\u00a0H., Lacoste-Julien, S.: Stochastic Polyak step-size for SGD: An adaptive learning rate for fast convergence. In: International Conference on Artificial Intelligence and Statistics, PMLR pp. 1306\u20131314 (2021)"},{"issue":"2","key":"541_CR39","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1137\/130936269","volume":"7","author":"DA Lorenz","year":"2014","unstructured":"Lorenz, D.A., Sch\u00f6pfer, F., Wenger, S.: The linearized Bregman method via split feasibility problems: analysis and generalizations. SIAM J. Imag. Sci. 7(2), 1237\u20131262 (2014)","journal-title":"SIAM J. Imag. Sci."},{"key":"541_CR40","unstructured":"Ma, S., Bassily, R., Belkin, M.: The power of interpolation: Understanding the effectiveness of SGD in modern over-parametrized learning. In: International conference on machine learning, pp 3325\u20133334. PMLR (2018)"},{"issue":"11","key":"541_CR41","doi-asserted-by":"publisher","first-page":"115013","DOI":"10.1088\/0266-5611\/32\/11\/115013","volume":"32","author":"P Maa\u00df","year":"2016","unstructured":"Maa\u00df, P., Strehlow, R.: An iterative regularization method for nonlinear problems based on Bregman projections. Inverse Prob. 32(11), 115013 (2016)","journal-title":"Inverse Prob."},{"key":"541_CR42","unstructured":"Mishchenko, K.: Regularized Newton method with global $$ {O} (1\/k^2) $$ convergence. arXiv preprint arXiv:2112.02089 (2021)"},{"issue":"2","key":"541_CR43","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-011-0468-9","volume":"129","author":"A Nedi\u0107","year":"2011","unstructured":"Nedi\u0107, A.: Random algorithms for convex minimization problems. Math. Program. 129(2), 225\u2013253 (2011)","journal-title":"Math. Program."},{"key":"541_CR44","volume-title":"Problem complexity and method efficiency in optimization","author":"AS Nemirovskij","year":"1983","unstructured":"Nemirovskij, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. Wiley, Hoboken (1983)"},{"issue":"1","key":"541_CR45","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."},{"issue":"2","key":"541_CR46","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/040605412","volume":"4","author":"S Osher","year":"2005","unstructured":"Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variation-based image restoration. Multisc. Model. Simul 4(2), 460\u2013489 (2005)","journal-title":"Multisc. Model. Simul"},{"key":"541_CR47","unstructured":"Pinsker, M.\u00a0S.: Information and information stability of random variables and processes (in Russian). Holden-Day, (1964)"},{"issue":"6","key":"541_CR48","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1080\/10556788.2019.1669154","volume":"35","author":"B Polyak","year":"2020","unstructured":"Polyak, B., Tremba, A.: New versions of Newton method: step-size choice, convergence domain and under-determined equations. Optimiz. Methods Software 35(6), 1272\u20131303 (2020)","journal-title":"Optimiz. Methods Software"},{"issue":"3","key":"541_CR49","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10898-019-00784-z","volume":"76","author":"B Polyak","year":"2020","unstructured":"Polyak, B., Tremba, A.: Sparse solutions of optimal control via Newton method for under-determined systems. J. Global Optim. 76(3), 613\u2013623 (2020)","journal-title":"J. Global Optim."},{"issue":"1","key":"541_CR50","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1080\/02331934.2018.1543295","volume":"68","author":"D Reem","year":"2019","unstructured":"Reem, D., Reich, S., De Pierro, A.: Re-examination of Bregman functions and new properties of their divergences. Optimization 68(1), 279\u2013348 (2019)","journal-title":"Optimization"},{"key":"541_CR51","first-page":"233","volume-title":"Optimizing methods in statistics","author":"H Robbins","year":"1971","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Optimizing methods in statistics, pp. 233\u2013257. Elsevier, Amsterdam (1971)"},{"key":"541_CR52","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex analysis, vol. 36. Princeton University Press, Princeton (1970)"},{"issue":"1","key":"541_CR53","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10107-017-1229-1","volume":"173","author":"F Sch\u00f6pfer","year":"2019","unstructured":"Sch\u00f6pfer, F., Lorenz, D.A.: Linear convergence of the randomized sparse Kaczmarz method. Math. Program. 173(1), 509\u2013536 (2019)","journal-title":"Math. Program."},{"key":"541_CR54","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.laa.2022.07.003","volume":"652","author":"F Sch\u00f6pfer","year":"2022","unstructured":"Sch\u00f6pfer, F., Lorenz, D.A., Tondji, L., Winkler, M.: Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems. Linear Algebra Appl. 652, 132\u2013154 (2022)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"541_CR55","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1088\/0266-5611\/22\/1\/017","volume":"22","author":"F Sch\u00f6pfer","year":"2006","unstructured":"Sch\u00f6pfer, F., Louis, A.K., Schuster, T.: Nonlinear iterative methods for linear ill-posed problems in Banach spaces. Inverse Prob. 22(1), 311 (2006)","journal-title":"Inverse Prob."},{"issue":"1","key":"541_CR56","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14(1), 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"541_CR57","doi-asserted-by":"crossref","unstructured":"Tondji, L., Lorenz, D.\u00a0A.: Faster randomized block sparse Kaczmarz by averaging. Numerical Algorithms, pp. 1\u201335 (2022)","DOI":"10.1007\/s11075-022-01473-x"},{"key":"541_CR58","doi-asserted-by":"publisher","first-page":"113720","DOI":"10.1016\/j.cam.2021.113720","volume":"399","author":"Q Wang","year":"2022","unstructured":"Wang, Q., Li, W., Bao, W., Gao, X.: Nonlinear Kaczmarz algorithms and their convergence. J. Comput. Appl. Math. 399, 113720 (2022)","journal-title":"J. Comput. Appl. Math."},{"key":"541_CR59","unstructured":"Wang, W., Carreira-Perpin\u00e1n, M.\u00a0A.: Projection onto the probability simplex: an efficient algorithm with a simple proof, and an application. arXiv preprint arXiv:1309.1541 (2013)"},{"key":"541_CR60","doi-asserted-by":"crossref","unstructured":"You, J.-K., Cheng, H.-C., Li, Y.-H.: Minimizing quantum R\u00e9nyi divergences via mirror descent with Polyak step size. In: 2022 IEEE International symposium on information theory (ISIT), IEEE, pp 252\u2013257 (2022)","DOI":"10.1109\/ISIT50566.2022.9834648"},{"key":"541_CR61","unstructured":"You, J.-K., Li, Y.-H.: Two Polyak-type step sizes for mirror descent. arXiv preprint arXiv:2210.01532 (2022)"},{"issue":"3","key":"541_CR62","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1137\/21M139788X","volume":"32","author":"R Yuan","year":"2022","unstructured":"Yuan, R., Lazaric, A., Gower, R.M.: Sketched Newton-Raphson. SIAM J. Optim. 32(3), 1555\u20131583 (2022)","journal-title":"SIAM J. Optim."},{"key":"541_CR63","doi-asserted-by":"crossref","unstructured":"Zalinescu, C.: Convex analysis in general vector spaces. World scientific, (2002)","DOI":"10.1142\/9789812777096"},{"issue":"3","key":"541_CR64","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/3446776","volume":"64","author":"C Zhang","year":"2021","unstructured":"Zhang, C., Bengio, S., Hardt, M., Recht, B., Vinyals, O.: Understanding deep learning (still) requires rethinking generalization. Commun. ACM 64(3), 107\u2013115 (2021)","journal-title":"Commun. ACM"},{"key":"541_CR65","first-page":"7040","volume":"30","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., Mertikopoulos, P., Bambos, N., Boyd, S., Glynn, P.W.: Stochastic mirror descent in variationally coherent optimization problems. Adv. Neural. Inf. Process. Syst. 30, 7040\u20137049 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"updated-by":[{"DOI":"10.1007\/s10589-024-00570-y","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00541-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00541-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00541-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T07:02:25Z","timestamp":1713078145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00541-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00541-9","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10589-024-00570-y","asserted-by":"object"}]},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"22 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10589-024-00570-y","URL":"https:\/\/doi.org\/10.1007\/s10589-024-00570-y","order":7,"name":"change_details","label":"Change Details","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"}}]}}