{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T05:17:34Z","timestamp":1780723054299,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:00:00Z","timestamp":1614211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:00:00Z","timestamp":1614211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["820\/17"],"award-info":[{"award-number":["820\/17"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["389\/12"],"award-info":[{"award-number":["389\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10107-021-01628-z","type":"journal-article","created":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T12:03:52Z","timestamp":1614254632000},"page":"1163-1183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems"],"prefix":"10.1007","volume":"194","author":[{"given":"Victor I.","family":"Kolobov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simeon","family":"Reich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0193-9610","authenticated-orcid":false,"given":"Rafa\u0142","family":"Zalas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"1628_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"1628_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.26.2.248.10558","volume":"26","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Combettes, P.L.: A weak-to-strong convergence principle for Fej\u00e9r-monotone methods in Hilbert spaces. Math. Oper. Res. 26, 248\u2013264 (2001)","journal-title":"Math. Oper. Res."},{"key":"1628_CR3","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. In: CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC. Springer, Cham, 2nd\u00a0edn., With a foreword by H\u00e9dy Attouch (2017)","DOI":"10.1007\/978-3-319-48311-5"},{"key":"1628_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/16M1071079","volume":"27","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Dao, M.N.: On the finite convergence of the Douglas\u2013Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces. SIAM J. Optim. 27, 507\u2013537 (2017)","journal-title":"SIAM J. Optim."},{"key":"1628_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-015-0373-5","volume":"65","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Dao, M.N., Noll, D., Phan, H.M.: On Slater\u2019s condition and finite convergence of the Douglas\u2013Rachford algorithm for solving convex feasibility problems in Euclidean spaces. J. Global Optim. 65, 329\u2013349 (2016)","journal-title":"J. Global Optim."},{"key":"1628_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmaa.2014.06.075","volume":"421","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Noll, D., Phan, H.M.: Linear and strong convergence of algorithms involving averaged nonexpansive operators. J. Math. Anal. Appl. 421, 1\u201320 (2015)","journal-title":"J. Math. Anal. Appl."},{"key":"1628_CR7","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/s10957-014-0659-7","volume":"165","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Wang, C., Wang, X., Xu, J.: On the finite convergence of a projected cutter method. J. Optim. Theory Appl. 165, 901\u2013916 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1628_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/15M1045223","volume":"27","author":"JM Borwein","year":"2017","unstructured":"Borwein, J.M., Li, G., Tam, M.K.: Convergence rate analysis for averaged fixed point iterations in common fixed point problems. SIAM J. Optim. 27, 1\u201333 (2017)","journal-title":"SIAM J. Optim."},{"key":"1628_CR9","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, 1755\u20131759 (2001)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1628_CR10","doi-asserted-by":"crossref","unstructured":"Cegielski, A.: Iterative methods for fixed point problems in Hilbert spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30901-4"},{"key":"1628_CR11","doi-asserted-by":"crossref","unstructured":"Cegielski, A., Censor, Y.: Opial-type theorems and the common fixed point problem. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, vol.\u00a049 of Springer Optim. Appl., pp 155\u2013183. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-9569-8_9"},{"key":"1628_CR12","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1137\/17M1134986","volume":"28","author":"A Cegielski","year":"2018","unstructured":"Cegielski, A., Reich, S., Zalas, R.: Regular sequences of quasi-nonexpansive operators and their applications. SIAM J. Optim. 28, 1508\u20131532 (2018)","journal-title":"SIAM J. Optim."},{"key":"1628_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00245-011-9139-8","volume":"64","author":"Y Censor","year":"2011","unstructured":"Censor, Y., Chen, W., Pajoohesh, H.: Finite convergence of a subgradient projections method with expanding controls. Appl. Math. Optim. 64, 273\u2013285 (2011)","journal-title":"Appl. Math. Optim."},{"key":"1628_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1731022.1731024","volume":"37","author":"W Chen","year":"2010","unstructured":"Chen, W., Herman, G.T.: Efficient controls for finitely convergent sequential algorithms. ACM Trans. Math. Software 37, 1\u201323 (2010)","journal-title":"ACM Trans. Math. Software"},{"key":"1628_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S1076-5670(08)70157-5","volume":"95","author":"PL Combettes","year":"1996","unstructured":"Combettes, P.L.: The convex feasibility problem in image recovery. Adv. Imaging Electron Phys. 95, 155\u2013270 (1996)","journal-title":"Adv. Imaging Electron Phys."},{"key":"1628_CR16","doi-asserted-by":"crossref","unstructured":"Combettes, P.L.: Quasi-Fej\u00e9rian analysis of some optimization algorithms. In: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa, 2000), vol. 8 of Stud. Comput. Math., pp. 115\u2013152. North-Holland, Amsterdam (2001)","DOI":"10.1016\/S1570-579X(01)80010-0"},{"key":"1628_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/B:AMHU.0000028410.94541.fb","volume":"103","author":"G Crombez","year":"2004","unstructured":"Crombez, G.: Finding common fixed points of a class of paracontractions. Acta Math. Hungar. 103, 233\u2013241 (2004)","journal-title":"Acta Math. Hungar."},{"key":"1628_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01448368","volume":"17","author":"AR De Pierro","year":"1988","unstructured":"De Pierro, A.R., Iusem, A.N.: A finitely convergent \u201crow-action\u2019\u2019 method for the convex feasibility problem. Appl. Math. Optim. 17, 225\u2013235 (1988)","journal-title":"Appl. Math. Optim."},{"key":"1628_CR19","volume-title":"Real Analysis and Probability","author":"RM Dudley","year":"2004","unstructured":"Dudley, R.M.: Real Analysis and Probability. Cambridge University Press, Cambridge (2004)"},{"key":"1628_CR20","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1109\/TAC.1982.1103081","volume":"27","author":"M Fukushima","year":"1982","unstructured":"Fukushima, M.: A finitely convergent algorithm for convex inequalities. IEEE Trans. Autom. Control 27, 1126\u20131127 (1982)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1628_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9440-2","volume-title":"Measure Theory","author":"PR Halmos","year":"1950","unstructured":"Halmos, P.R.: Measure Theory. D. Van Nostrand Company Inc, New York (1950)"},{"key":"1628_CR22","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.laa.2006.11.009","volume":"428","author":"GT Herman","year":"2008","unstructured":"Herman, G.T., Chen, W.: A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy. Linear Algebra Appl. 428, 1207\u20131217 (2008)","journal-title":"Linear Algebra Appl."},{"key":"1628_CR23","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."},{"key":"1628_CR24","first-page":"169","volume":"5","author":"AN Iusem","year":"1986","unstructured":"Iusem, A.N., Moledo, L.: A finitely convergent method of simultaneous subgradient projections for the convex feasibility problem. Mat. Appl. Comput. 5, 169\u2013184 (1986)","journal-title":"Mat. Appl. Comput."},{"key":"1628_CR25","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF02584829","volume":"18","author":"AN Iusem","year":"1987","unstructured":"Iusem, A.N., Moledo, L.: On finitely convergent iterative methods for the convex feasibility problem. Bol. Soc. Brasil. Mat. 18, 11\u201318 (1987)","journal-title":"Bol. Soc. Brasil. Mat."},{"key":"1628_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-018-1343-8","volume":"180","author":"DR Luke","year":"2020","unstructured":"Luke, D.R., Teboulle, M., Thao, N.H.: Necessary conditions for linear convergence of iterated expansive, set-valued mappings. Math. Program. 180, 1\u201331 (2020)","journal-title":"Math. Program."},{"key":"1628_CR27","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A.: Random projection algorithms for convex set intersection problems. In: 49th IEEE Conference on Decision and Control (CDC), pp 7655\u20137660 (2010)","DOI":"10.1109\/CDC.2010.5717734"},{"key":"1628_CR28","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-014-0759-z","volume":"149","author":"CHJ Pang","year":"2015","unstructured":"Pang, C.H.J.: Set intersection problems: supporting hyperplanes and quadratic programming. Math. Program. 149, 329\u2013359 (2015)","journal-title":"Math. Program."},{"key":"1628_CR29","doi-asserted-by":"crossref","unstructured":"Polyak, B.T.: Random algorithms for solving convex inequalities. In: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa, 2000), vol. 8 of Stud. Comput. Math., pp. 409\u2013422. North-Holland, Amsterdam (2001)","DOI":"10.1016\/S1570-579X(01)80024-0"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01628-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01628-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01628-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T19:05:43Z","timestamp":1656356743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01628-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,25]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1628"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01628-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,25]]},"assertion":[{"value":"14 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}