PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
From MaRDI portal
Theoretical paper on the development of two parallel algorithms for common fixed points of several paracontractions (are nonexpansive). The first algorithm includes all operators, the second operators on subsets (is less robust). No (numerical) examples.
Recommendations
- A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
- Parallel algorithms for variational inclusions and fixed points with applications
- Parallel algorithms for solving a class of variational inequalities over the common fixed points set of a finite family of demicontractive mappings
- A parallel method for common variational inclusion and common fixed point problems with applications
- Parallel synchronous algorithm for nonlinear fixed point problems
- Parallel asynchronous iterations of least fixed points
- Parallel iterative algorithm for solving the multiple-set split common fixed-point problem
- Parallel iterative methods for solving the split common fixed point problem in Hilbert spaces
- A Parallel Algorithm for a Class of Convex Programs
- Iterative methods for parallel convex optimization with fixed point constraints
Cites work
- Block-iterative surrogate projection methods for convex feasibility problems
- Convergence of sequential and asynchronous nonlinear paracontractions
- Decomposition through formalization in a product space
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- Incomplete projection algorithms for solving the convex feasibility problem
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
- The method of projections for finding the common point of convex sets
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
Cited in
(7)- A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
- scientific article; zbMATH DE number 1894728 (Why is no real title available?)
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
- Finding common fixed points of a class of paracontractions
- Parallel asynchronous iterations of least fixed points
- Reflection-projection method for convex feasibility problems with an obtuse cone
This page was built for publication: PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4546045)