String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
From MaRDI portal
Publication:2138440
DOI10.1186/s13663-021-00694-4MaRDI QIDQ2138440
Publication date: 12 May 2022
Published in: Fixed Point Theory and Algorithms for Sciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.07891
projection methods; common fixed points; best approximation problem; firmly nonexpansive operators; Halpern theorem; HLWB algorithm; string-averaging
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Iterative methods for fixed point problems in Hilbert spaces
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- A new projection method for finding the closest point in the intersection of convex sets
- Approximation of fixed points of nonexpansive mappings
- On the convergence of von Neumann's alternating projection algorithm for two sets
- The rate of convergence for the method of alternating projections. II
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Computational acceleration of projection algorithms for the linear best approximation problem
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- An Algorithm for Restricted Least Squares Regression
- Projection methods: an annotated bibliography of books and reviews
- On the string averaging method for sparse common fixed‐point problems
- Random Products of Contractions in Banach Spaces
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- Energy-based sensor network source localization via projection onto convex sets
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- String-averaging algorithms for convex feasibility with infinitely many sets
- Fixed points of nonexpanding maps
- String-averaging projected subgradient methods for constrained minimization
- Functional Operators (AM-22), Volume 2
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning