Open AccessA Real-Time Iterative Projection Scheme for Solving the Common Fixed Point Problem and Its Applications
Author(s) -
Aviv Gibali,
Aviv Gibali,
David Teller,
David Teller
Publication year - 2018
Publication title -
sovremennaâ matematika. fundamentalʹnye napravleniâ
Language(s) - English
Resource type - Journals
eISSN - 2949-0618
pISSN - 2413-3639
DOI - 10.22363/2413-3639-2018-64-4-616-636
Subject(s) - scheme (mathematics) , convergence (economics) , hilbert space , mathematics , projection (relational algebra) , algorithm , fixed point , computer science , regular polygon , block (permutation group theory) , mathematical optimization , projection method , iterative method , dykstra's projection algorithm , geometry , economics , mathematical analysis , economic growth
In this paper, we are concerned with the Common Fixed Point Problem (CFPP) with demicontractive operators and its special instance, the Convex Feasibility Problem (CFP) in real Hilbert spaces. Motivated by the recent result of Ordon˜ ez et al. [35] and in general, the eld of online/real-time algorithms, e.g., [20, 21, 30], in which the entire input is not available from the beginning and given piece-by-piece, we propose an online/real-time iterative scheme for solving CFPPs and CFPs in which the involved operators/sets emerge along time. This scheme is capable of operating on any block, for any nite number of iterations, before moving, in a serial way, to the next block. The scheme is based on the recent novel result of Reich and Zalas [37] known as the Modular String Averaging (MSA) procedure. The convergence of the scheme follows [37] and other classical results in the elds of xed point theory and variational inequalities, such as [34]. Numerical experiments for linear and non-linear feasibility problems with applications to image recovery are presented and demonstrate the validity and potential applicability of our scheme, e.g., to online/real-time scenarios.