Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
From MaRDI portal
Publication:2423796
DOI10.1007/S10898-019-00747-4zbMath1461.90098arXiv1808.04723OpenAlexW2887855380WikidataQ128391864 ScholiaQ128391864MaRDI QIDQ2423796
Publication date: 20 June 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04723
fixed point iterationconvex feasibility problemKaczmarz methodnonexpansive operatorasynchronous sequential iterationsDROP algorithm
Related Items (4)
Feasibility-based fixed point networks ⋮ An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces ⋮ Time scale-induced asynchronous discrete dynamical systems ⋮ A multi-step inertial asynchronous sequential algorithm for common fixed point problems
Uses Software
Cites Work
- 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
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Iterative methods for fixed point problems in Hilbert spaces
- A convergence theorem for chaotic asynchronous relaxation
- An inertial forward-backward algorithm for monotone inclusions
- Convergence theorems for inertial KM-type algorithms
- A note on a mean ergodic theorem for nonlinear semigroups
- An automatic relaxation method for solving interval linear inequalities
- 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
- Block-iterative surrogate projection methods for convex feasibility problems
- On asynchronous iterations
- On unbounded delays in asynchronous parallel fixed-point algorithms
- Convergence analysis of processes with valiant projection operators in Hilbert space
- Convergence of a splitting inertial proximal method for monotone operators
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Extrapolation algorithm for affine-convex feasibility problems
- Chaotic relaxation
- Fundamentals of Computerized Tomography
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments
- On Diagonally Relaxed Orthogonal Projection Methods
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- A relaxation method for reconstructing objects from noisy X-rays
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Convergence Rates for Projective Splitting
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Some methods of speeding up the convergence of iteration methods
- 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
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
