Censor, Yair; Zaslavski, Alexander - In: Computational Optimization and Applications 54 (2013) 1, pp. 65-76
We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience. In the past, SAP methods were formulated with a single predetermined set of...