Abstract
For a suitable set of not necessarily linear operators on a real Hilbert space, such that the set of common fixed points of the operators is nonempty and has an interior point, we construct an asynchronous parallel algorithm that leads to a common fixed point in a finite number of steps. This generalizes a result in [13].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Bauschke and J. Borwein, On projection algorithms for solving convex feasibility problems, Siam Review, 38 (1996), 367-426.
H. Bauschke, F. Deutsch, H. Hundal and S.-H. Park, Accelerating the convergence of the method of alternating projections (preprint).
D. Butnariu and Y. Censor, Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces, Journal of Computational and Applied Mathematics, 53 (1994), 33-42.
Y. Censor and S. A. Zenios, Parallel Optimization. Theory, Algorithms, and Applications, Oxford University Press, Inc. (New York, 1997).
Y. Censor, T. Elfving and G. T. Herman, Averaging strings of sequential iterations for convex feasibility problems, in: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, D. Butnariu, Y. Censor and S. Reich (editors), Elsevier (Amsterdam, 2001), pp. 101-113.
P. L. Combettes, Construction d'un point fixe commun à une famille de contractions fermes, C.R. Acad. Sci. Paris, 320, Série I (1995), 1385-1390.
P. L. Combettes, Quasi-Fejérian analysis of some optimization algorithms, in: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, D. Butnariu, Y. Censor and S. Reich (editors), Elsevier (Amsterdam, 2001), 115-152.
G. Crombez, Viewing parallel projection methods as sequential ones in convex feasibility problems, Trans. Amer. Math. Soc., 347 (1995), 2575-2583.
G. Crombez, Improving the speed of convergence in the method of projections onto convex sets, Publ. Math. Debrecen, 58 (2001), 29-48.
L. Elsner, I. Koltracht and M. Neumann, Convergence of sequential and asynchronous nonlinear paracontractions, Numer. Math., 62 (1992), 305-319.
L. G. Gubin, B. T. Polyak and E. V. Raik, The method of projections for finding the common point of convex sets, USSR Comput. Math. and Math. Phys., 7 (1967), 1-24.
K. Kiwiel, Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra and its Applic., 215 (1995), 225-259.
B. T. Polyak, Random algorithms for solving convex inequalities, in: Inherently parallel Algorithms in Feasibility and Optimization and their Applications, D. Butnariu, Y. Censor and S. Reich (editors), Elsevier (Amsterdam, 2001), 409-422.
H. Stark and Y. Yang, Vector Space Projections, J. Wiley & Sons, Inc. (New York, 1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Crombez, G. Finding common fixed points of a class of paracontractions. Acta Mathematica Hungarica 103, 233–241 (2004). https://doi.org/10.1023/B:AMHU.0000028410.94541.fb
Issue Date:
DOI: https://doi.org/10.1023/B:AMHU.0000028410.94541.fb