A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
DOI10.1007/s11075-015-0045-zzbMath1348.47065OpenAlexW1210354003MaRDI QIDQ297551
Publication date: 27 June 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-015-0045-z
convex feasibility problemsuperiorizationcommon fixed point problemfirmly nonexpansive operatorquasi-nonexpansive operatorintermittent controlalmost cyclic controlblock iterative algorithmscuttercyclic controlnonexpansive operatorperturbation resiliencestring averagingsubgradient projection
Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
Cites Work
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Iterative methods for fixed point problems in Hilbert spaces
- Hilbertian convex feasibility problem: Convergence of projection methods
- Relaxed outer projections, weighted averages and convex feasibility
- Convergence results for an accelerated nonlinear Cimmino algorithm
- A parallel subgradient projections method for the convex feasibility problem
- An example concerning fixed points
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- Projection and proximal point methods: Convergence results and counterexamples.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Random products of contractions in metric and Banach spaces
- Ill-posed problems with a priori information
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- A cyclic Douglas-Rachford iteration scheme
- Nonexpansive projections on subsets of Banach spaces
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Construction of fixed points of nonlinear mappings in Hilbert space
- Ball intersection model for Fejér zones of convex closed sets
- Opial-Type Theorems and the Common Fixed Point Problem
- Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings
- Application of Quasi-Nonexpansive Operators to an Iterative Method for Variational Inequality
- Projection methods: an annotated bibliography of books and reviews
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- On the string averaging method for sparse common fixed‐point problems
- Perturbation resilience and superiorization of iterative algorithms
- A limit theorem for projections
- Decomposition through formalization in a product space
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Cyclic subgradient projections
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Relaxed averaged alternating reflections for diffraction imaging
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
- The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
- On Subgradient Projectors
- A projection method for approximating fixed points of quasi nonexpansive mappings without the usual demiclosedness condition
- A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- The method of projections for finding the common point of convex sets
- On the Mann Iterative Process
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- String-averaging projected subgradient methods for constrained minimization
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Convex analysis and monotone operator theory in Hilbert spaces
- Attracting mappings in Banach and hyperbolic spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item