An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
From MaRDI portal
Publication:5065443
DOI10.1017/S0013091522000049OpenAlexW4212822452MaRDI QIDQ5065443
M. O. Nnakwe, Abdulmalik Usman Bello
Publication date: 21 March 2022
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0013091522000049
Nonlinear accretive operators, dissipative operators, etc. (47H06) Iterative procedures involving nonlinear operators (47J25) Set-valued operators (47H04)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong convergence theorem for strict pseudo-contractions in Hilbert spaces
- Parallel asynchronous iterations for the solution of a 3D continuous flow electrophoresis problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Iterative methods for fixed point problems in Hilbert spaces
- Hilbertian convex feasibility problem: Convergence of projection methods
- Asynchronous finite-difference schemes for partial differential equations
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Convergence of sequential and asynchronous nonlinear paracontractions
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Asynchronous multisplitting methods for nonlinear fixed point problems
- Strong convergence of modified Mann iterations
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- Extrapolation algorithm for affine-convex feasibility problems
- Construction of fixed points of demicompact mappings in Hilbert space
- Construction of fixed points of nonlinear mappings in Hilbert space
- Chaotic relaxation
- Fundamentals of Computerized Tomography
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- The multiple-sets split feasibility problem and its applications for inverse problems
- Projection methods: an annotated bibliography of books and reviews
- A limit theorem for projections
- Asynchronous Iterative Methods for Multiprocessors
- Implicit-Explicit Parallel Asynchronous Solver of Parabolic PDEs
- Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
- Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- Fixed points of nonexpanding maps
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
This page was built for publication: An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
