{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:47:29Z","timestamp":1765039649594,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"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":["Numer Algor"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11075-022-01468-8","type":"journal-article","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:02:30Z","timestamp":1671591750000},"page":"1269-1307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The method of randomized Bregman projections for stochastic feasibility problems"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2876-8834","authenticated-orcid":false,"given":"Vladimir R.","family":"Kosti\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saverio","family":"Salzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"unstructured":"Ash, R.B., Dol\u00e9ans-Dade, C.A.: Probability & Measure Theory. Academic Press, San Diego, CA USA (2000)","key":"1468_CR1"},{"unstructured":"Azizan, N., Hassibi, B.: Stochastic gradient\/mirror descent: minimax optimality and implicit regularization. Int. Conf. Learn. Representations (ICLR):1\u201318 (2019)","key":"1468_CR2"},{"key":"1468_CR3","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I., Ghosh, J.: Clustering with Bregman divergences. J. Mach. Learn. Res. 6, 1705\u20131749 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"1468_CR4","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1142\/S0219199701000524","volume":"3","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Borwein, J.M., Combettes, P.L.: Essential smoothness, essential strict convexity, and Legendre functions in Banach spaces. Commun. Contemp. Math. 3, 615\u2013647 (2001)","journal-title":"Commun. Contemp. Math."},{"key":"1468_CR5","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, 596\u2013636 (2003)","journal-title":"SIAM J. Control Optim."},{"key":"1468_CR6","first-page":"27","volume":"4","author":"HH Bauschke","year":"1997","unstructured":"Bauschke, H.H., Combettes, P.L.: Legendre functions and the method of random Bregman projections. J. Convex Anal. 4, 27\u201367 (1997)","journal-title":"J. Convex Anal."},{"key":"1468_CR7","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, 1159\u20131173 (2003)","journal-title":"SIAM J. Optim."},{"key":"1468_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jat.2008.08.014","volume":"159","author":"HH Bauschke","year":"2009","unstructured":"Bauschke, H.H., Wang, X., Ye, J., Yuang, X.: Bregman distances and Chebyshev sets. J. Approx. Theory 159, 3\u201325 (2009)","journal-title":"J. Approx. Theory"},{"key":"1468_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, A1111\u2013A1138 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"1468_CR10","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, 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1468_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1008654413997","volume":"8","author":"D Butnariu","year":"1997","unstructured":"Butnariu, D., Censor, Y., Reich, S.: Iterative averaging of entropic projections for solving stochastic convex feasibility problems. Comput. Optim. Appl. 8, 21\u201339 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"1468_CR12","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1080\/01630569508816635","volume":"16","author":"D Butnariu","year":"1995","unstructured":"Butnariu, D., Fla\u0307m, S.D.: Strong convergence of expected-projection methods in Hilbert spaces. Numer. Funct. Anal. and Optimiz. 16, 601\u2013636 (1995)","journal-title":"Numer. Funct. Anal. and Optimiz."},{"key":"1468_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1008795702124","volume":"15","author":"D Butnariu","year":"2000","unstructured":"Butnariu, D., Iusem, A., Burachik, R.: Iterative methods of solving stochastic convex feasibility problems and applications. Comput. Optim. Appl. 15, 269\u2013307 (2000)","journal-title":"Comput. Optim. Appl."},{"issue":"11","key":"1468_CR14","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1109\/9.964685","volume":"46","author":"G Calafiore","year":"2001","unstructured":"Calafiore, G., Polyak, B.T.: Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Trans. Autom. Control 46(11), 1755\u20131759 (2001)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1468_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0087685","volume-title":"Convex Analysis and Measurable Multifunctions Lecture Notes in Mathematics, vol. 580","author":"C Castaing","year":"1977","unstructured":"Castaing, C., Valadier, M.: Convex Analysis and Measurable Multifunctions Lecture Notes in Mathematics, vol. 580. Springer, New York (1977)"},{"key":"1468_CR16","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, 321\u2013353 (1981)","journal-title":"J. Optim. Theory Appl."},{"key":"1468_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/02331939608844225","volume":"37","author":"Y Censor","year":"1996","unstructured":"Censor, Y., Reich, S.: Iteration of paracontractions and firmly nonexpansive operators with applications to feasibility optimization. Optimization 37, 323\u2013339 (1996)","journal-title":"Optimization"},{"unstructured":"Censor, Y., Zenios, A.: Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press New York (1997)","key":"1468_CR18"},{"key":"1468_CR19","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, 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1468_CR20","first-page":"326","volume":"IX","author":"G Cimmino","year":"1938","unstructured":"Cimmino, G.: Calcolo approssimato per le soluzioni di sistemi di equazioni lineari. La Ricerca Scientifica Anno IX(2), 326\u2013333 (1938)","journal-title":"La Ricerca Scientifica Anno"},{"key":"1468_CR21","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/5.214546","volume":"81","author":"PL Combettes","year":"1993","unstructured":"Combettes, P.L.: The foundations of set theoretic estimation. Proc. IEEE 81, 182\u2013208 (1993)","journal-title":"Proc. IEEE"},{"issue":"1","key":"1468_CR22","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-018-1296-y","volume":"B174","author":"PL Combettes","year":"2019","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic quasi-fej\u00e9r block-coordinate fixed point iterations with random sweeping II: mean-square and linear convergence. Math. Program. B174(1), 433\u2013451 (2019)","journal-title":"Math. Program."},{"key":"1468_CR23","first-page":"1","volume":"19","author":"A Dessein","year":"2018","unstructured":"Dessein, A., Papadakis, N., Rouas, J.-L.: Regularized optimal transport and the ROT mover\u2019s distance. J. Mach. Learn. Res. 19, 1\u201353 (2018)","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Deutsch, F.: The method of alternating orthogonal projections. In: Singh, S. (ed.) Approximation Theory, Spline Functions and Applications. Kluwer Academic (1992)","key":"1468_CR24","DOI":"10.1007\/978-94-011-2634-2_5"},{"key":"1468_CR25","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/060649021","volume":"29","author":"IS Dhillon","year":"2007","unstructured":"Dhillon, I.S., Tropp, J.A.: Matrix nearness problems with Bregman divergences. SIAM J. Matrix Anal. Appl. 29, 1120\u20131146 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."},{"unstructured":"Duff, I.S., Grimes, R.G., Lewis, J.G.: Users\u2019 guide for the Harwell-Boeing sparse matrix collection (release i) (1992)","key":"1468_CR26"},{"key":"1468_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2010","unstructured":"Durrett, R.: Probability: Theory and Examples, 4th edn. Cambridge University Press, New York (2010)","edition":"4th edn."},{"key":"1468_CR28","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.1162\/NECO_a_00168","volume":"23","author":"C F\u00e9votte","year":"2011","unstructured":"F\u00e9votte, C., Idier, J.: Algorithms for nonnegative matrix factorization with the \u03b2-divergence. Neural Comput. 23, 2421\u20132456 (2011)","journal-title":"Neural Comput."},{"issue":"2","key":"1468_CR29","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/19M1285846","volume":"42","author":"R Gower","year":"2021","unstructured":"Gower, R., Molitor, D., Moorman, J., Needell, D.: Adaptive sketch-and-project methods for solving linear systems. SIAM J. Matrix Anal. Appl. 42(2), 954\u2013989 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1468_CR30","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1137\/15M1025487","volume":"36","author":"R Gower","year":"2015","unstructured":"Gower, R., Richtarik, P.: Randomized iterative methods for linear systems. SIAM J. Matrix Anal. Appl. 36, 1660\u20131690 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1468_CR31","first-page":"96","volume":"23","author":"I Halperin","year":"1962","unstructured":"Halperin, I.: The product of projection operators. Acta Sci. Math. (Szeged) 23, 96\u201399 (1962)","journal-title":"Acta Sci. Math. (Szeged)"},{"doi-asserted-by":"crossref","unstructured":"Hosmer, D.W., Lemeshow, S.: Applied Logistic Regression. Wiley (2005)","key":"1468_CR32","DOI":"10.1002\/0470011815.b2a10029"},{"key":"1468_CR33","first-page":"355","volume":"35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angenherte sufl\u00f6sung von systemen linearer gleichungen. Bull. Int. Acad. Polon. Sci., Cl. Sci. Math., Ser. A, Sci. Math. 35, 355\u2013357 (1937)","journal-title":"Bull. Int. Acad. Polon. Sci., Cl. Sci. Math., Ser. A, Sci. Math."},{"key":"1468_CR34","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/140963479","volume":"36","author":"VR Kostic","year":"2015","unstructured":"Kostic, V.R., Miedlar, A., Stolwijk, J.: On matrix nearness problems: distance to delocalization. SIAM J. Matrix Anal. Appl. 36, 435\u2013460 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1468_CR35","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1080\/01630563.2018.1535507","volume":"40","author":"N Hermer","year":"2019","unstructured":"Hermer, N., Luke, D.R., Sturm, A.: Random function iterations for consistent stochastic feasibility. Numer. Funct. Anal. Optim. 40, 386\u2013420 (2019)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"3","key":"1468_CR36","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219\u2013252 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"unstructured":"Loizou, N., Richt\u00e1rik, P.: Revisiting randomized gossip algorithms: general framework, convergence rates and novel block and accelerated protocols, pp. 1-44. arXiv:1905.08645 (2019)","key":"1468_CR37"},{"issue":"1","key":"1468_CR38","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCNS.2016.2598665","volume":"5","author":"H Mangesius","year":"2016","unstructured":"Mangesius, H., Xue, X.D., Hirche, S.: Consensus driven by the geometric mean. IEEE Trans. Control Netw. Syst. 5(1), 251\u2013261 (2016)","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"1468_CR39","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0962492920000021","volume":"29","author":"P-G Martinsson","year":"2020","unstructured":"Martinsson, P.-G., Tropp, J.: Randomized numerical linear algebra: foundations & algorithms. Acta Numer. 29, 403\u2013572 (2020)","journal-title":"Acta Numer."},{"doi-asserted-by":"crossref","unstructured":"Mavroforakis, C., Erd\u00f6s, D., Crovella, M., Terzi, E.: Active positive-definite matrix completion. In: Proceedings of the 2017 SIAM international conference on data mining, pp. 264\u2013272 (2017)","key":"1468_CR40","DOI":"10.1137\/1.9781611974973.30"},{"unstructured":"Mazko, A.: Matrix equations, spectral problems and stability of dynamic systems. Stability, oscillations and optimization of systems. Cambridge Scientific Publishers (2008)","key":"1468_CR41"},{"doi-asserted-by":"crossref","unstructured":"Muzellec, B., Nock, R., Patrini, G., Nielsen, F.: Tsallis regularized optimal transport and ecological inference. In: Proceedings of the thirty-first AAAI conference on artificial intelligence, pp. 2387\u20132393 (2017)","key":"1468_CR42","DOI":"10.1609\/aaai.v31i1.10854"},{"key":"1468_CR43","doi-asserted-by":"publisher","first-page":"2814","DOI":"10.1137\/18M1167061","volume":"29","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Richt\u00e1rik, P., Patrascu, A.: Randomized projection methods for convex feasibility: conditioning and convergence rates. SIAM J. Optim. 29, 2814\u20132852 (2019)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A.: Random projection algorithms for convex set intersection problems. 49th IEEE conference on decision and control (CDC) pp. 7655\u20137660 (2010)","key":"1468_CR44","DOI":"10.1109\/CDC.2010.5717734"},{"issue":"\/1","key":"1468_CR45","first-page":"443","volume":"86","author":"D Needell","year":"2019","unstructured":"Needell, D., Rebrova, E.: On block gaussian sketching for the Kaczmarz method. Numer. Alg. 86(\/1), 443\u2013473 (2019)","journal-title":"Numer. Alg."},{"key":"1468_CR46","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22, 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Peyr\u00e9, G., Cuturi, M.: Computational optimal transport: with applications to data sciences. Now publishers incorporated, USA (2019)","key":"1468_CR47","DOI":"10.1561\/9781680835519"},{"key":"1468_CR48","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, 279\u2013348 (2019)","journal-title":"Optimization"},{"key":"1468_CR49","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/18M1179249","volume":"41","author":"P Richt\u00e1rik","year":"2020","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Stochastic reformulations of linear systems: algorithms and convergence theory. SIAM J. Matrix Anal. Appl. 41, 487\u2013524 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press Princeton (1970)","key":"1468_CR50"},{"key":"1468_CR51","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1214\/aos\/1176324703","volume":"23","author":"L Ruschendorf","year":"1995","unstructured":"Ruschendorf, L.: Convergence of the iterative proportional fitting procedure. Ann. Statist. 23, 1160\u20131174 (1995)","journal-title":"Ann. Statist."},{"issue":"\/2","key":"1468_CR52","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1137\/20M1350947","volume":"42","author":"S Steinerberger","year":"2021","unstructured":"Steinerberger, S.: Randomized Kaczmarz converges along small singular vectors. SIAM J. Matrix Anal. Appl. 42(\/2), 608\u2013615 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1468_CR53","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2009","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"key":"1468_CR54","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-018-1282-4","volume":"178","author":"T Sun","year":"2019","unstructured":"Sun, T., Tran-Dinh, Q.: Generalized self-concordant functions: a recipe for newton-type methods. Math. Program. 178, 145\u2013213 (2019)","journal-title":"Math. Program."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01468-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01468-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01468-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T08:24:45Z","timestamp":1686126285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01468-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,21]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1468"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01468-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,12,21]]},"assertion":[{"value":"17 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}