{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T01:12:12Z","timestamp":1785460332373,"version":"3.56.0"},"reference-count":24,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>In this paper, we study a feasibility problem with infinitely many sets in a metric space. We present a novel algorithm and analyze its convergence. The algorithms used for the feasibility problem in the literature work for finite collections of sets and cannot be applied if the collection of sets is infinite. The main feature of these algorithms is that, for iterative steps, we need to calculate the values of all the operators belonging to our family of maps and even their sums with weighted coefficients. This is impossible if the family of maps is not finite. In the present paper, we introduce a new algorithm for solving feasibility problems with infinite families of sets and study its convergence. It turns out that our results hold for feasibility problems in a general metric space.<\/jats:p>","DOI":"10.3390\/axioms12030273","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T05:18:43Z","timestamp":1678079923000},"page":"273","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving Feasibility Problems with Infinitely Many Sets"],"prefix":"10.3390","volume":"12","author":[{"given":"Alexander J.","family":"Zaslavski","sequence":"first","affiliation":[{"name":"Department of Mathematics, Technion\u2013Israel Institute of Technology, Haifa 3200003, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1090\/S0002-9939-02-06528-0","article-title":"The composition of projections onto closed convex sets in Hilbert space is asymptotically regular","volume":"131","author":"Bauschke","year":"2003","journal-title":"Proc. Am. Math. Soc."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01027691","article-title":"On the convergence of von Neumann\u2019s alternating projection algorithm for two sets","volume":"1","author":"Bauschke","year":"1993","journal-title":"Set-Valued Anal."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","article-title":"On projection algorithms for solving convex feasibility problems","volume":"38","author":"Bauschke","year":"1996","journal-title":"SIAM Rev."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Censor, Y., and Reich, S. (1997). Recent Developments in Optimization Theory and Nonlinear Analysis, American Mathematical Society.","DOI":"10.1090\/conm\/204"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jat.2004.02.006","article-title":"Finding best approximation pairs relative to two closed convex sets in Hilbert spaces","volume":"127","author":"Bauschke","year":"2004","journal-title":"J. Approx. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/636\/12726","article-title":"Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces","volume":"636","author":"Bauschke","year":"2015","journal-title":"Contemp. Math."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/JSTSP.2007.910263","article-title":"Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems","volume":"1","author":"Butnariu","year":"2007","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"ref_8","unstructured":"Butnariu, D., Reich, S., and Zaslavski, A.J. (2006). Fixed Point Theory and Its Applications, Yokohama Publisher."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1088\/0266-5611\/26\/6\/065008","article-title":"Perturbation resilience and superiorization of iterative algorithms","volume":"26","author":"Censor","year":"2010","journal-title":"Inverse Probl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1007\/s10957-013-0408-3","article-title":"Projected subgradient minimization versus superiorization","volume":"160","author":"Censor","year":"2014","journal-title":"J. Optim. Theory Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10107-014-0788-7","article-title":"Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods","volume":"152","author":"Censor","year":"2015","journal-title":"Math. Program."},{"key":"ref_12","first-page":"565","article-title":"Algorithms and convergence results of projection methods for inconsistent feasibility problems: A review","volume":"3","author":"Censor","year":"2018","journal-title":"Pure Appl. Func. Anal."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Censor, Y., and Zur, Y. (2016). Linear Superiorization for Infeasible Linear Programming, Springer.","DOI":"10.1007\/978-3-319-44914-2_2"},{"key":"ref_14","first-page":"243","article-title":"A new split inverse problem and an application to least intensity feasible solutions","volume":"2","author":"Gibali","year":"2017","journal-title":"Pure Appl. Funct. Anal."},{"key":"ref_15","first-page":"1211","article-title":"Projection methods for finding a common point of convex sets","volume":"7","author":"Gurin","year":"1967","journal-title":"Zhurn. Vycisl. Mat. Mat. Fiz."},{"key":"ref_16","first-page":"379","article-title":"A note on the von Neumann alternating projections algorithm","volume":"5","author":"Kopecka","year":"2004","journal-title":"J. Nonlinear Convex Anal."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s11784-013-0097-4","article-title":"A note on alternating projections in Hilbert space","volume":"12","author":"Kopecka","year":"2012","journal-title":"J. Fixed Point Theory Appl."},{"key":"ref_18","first-page":"367","article-title":"A note on the multiple-set split convex feasibility problem in Hilbert space","volume":"8","author":"Masad","year":"2007","journal-title":"J. Nonlinear Convex Anal."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1007\/s10957-021-01910-2","article-title":"Projection algorithms for solving the split feasibility problem with multiple output sets","volume":"190","author":"Reich","year":"2021","journal-title":"J. Optim. Theory Appl."},{"key":"ref_20","first-page":"685","article-title":"The split common fixed point problem and the shrinking projection method for new nonlinear mappings in two Banach spaces","volume":"2","author":"Takahashi","year":"2017","journal-title":"Pure Appl. Funct. Anal."},{"key":"ref_21","first-page":"349","article-title":"A general iterative method for split common fixed point problems in Hilbert spaces and applications","volume":"3","author":"Takahashi","year":"2018","journal-title":"Pure Appl. Funct. Anal."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zaslavski, A.J. (2016). Approximate Solutions of Common Fixed Point Problems, Springer. Springer Optimization and Its Applications.","DOI":"10.1007\/978-3-319-33255-0"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Zaslavski, A.J. (2018). Algorithms for Solving Common Fixed Point Problems, Springer. Springer Optimization and Its Applications.","DOI":"10.1007\/978-3-319-77437-4"},{"key":"ref_24","unstructured":"Butnariu, D., Censor, Y., and Reich, S. (2001). Inherently Parallel Algorithms in Feasi- Bility and Optimization and Their Applications, North-Holland."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/3\/273\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:48:52Z","timestamp":1760122132000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/3\/273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,6]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["axioms12030273"],"URL":"https:\/\/doi.org\/10.3390\/axioms12030273","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,6]]}}}