An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
From MaRDI portal
Publication:5065443
Recommendations
- Iterative methods for strict pseudo-contractions in Hilbert spaces
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- Strong convergence of an inertial-type algorithm to a common solution of minimization and fixed point problems
- An algorithm with strong convergence for the split common fixed point problem of total asymptotically strict pseudocontraction mappings
- The split common fixed point problem for total asymptotically strictly pseudocontractive mappings
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3544691 (Why is no real title available?)
- scientific article; zbMATH DE number 3615396 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 1444680 (Why is no real title available?)
- A limit theorem for projections
- A note on the multiple-set split convex feasibility problem in Hilbert space
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- Asynchronous Iterative Methods for Multiprocessors
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Asynchronous finite-difference schemes for partial differential equations
- Asynchronous multisplitting methods for nonlinear fixed point problems
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Chaotic relaxation
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Construction of fixed points of demicompact mappings in Hilbert space
- Construction of fixed points of nonlinear mappings in Hilbert space
- Convergence of sequential and asynchronous nonlinear paracontractions
- Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Extrapolation algorithm for affine-convex feasibility problems
- Fixed points of nonexpanding maps
- Fundamentals of Computerized Tomography
- Hilbertian convex feasibility problem: Convergence of projection methods
- Implicit-Explicit Parallel Asynchronous Solver of Parabolic PDEs
- Iterative methods for fixed point problems in Hilbert spaces
- Mean Value Methods in Iteration
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Parallel asynchronous iterations for the solution of a 3D continuous flow electrophoresis problem
- Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- Projection methods: an annotated bibliography of books and reviews
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Strong convergence of modified Mann iterations
- Strong convergence theorem for strict pseudo-contractions in Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
Cited in
(2)
This page was built for publication: An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065443)
