Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings

DOI10.1137/14095724XzbMath1321.47147OpenAlexW2022330448MaRDI QIDQ2946212

Mokhtar Abbasi, Touraj Nikazad

Publication date: 16 September 2015

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/14095724x

zbMATH Keywords

nonexpansive operatorsprojection methodsconvex feasibilityblock-iterative methodsstring-averagingparacontracting operators

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative numerical methods for linear systems (65F10) Perturbations of nonlinear operators (47H14)

Related Items (6)

A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ A new step size rule for the superiorization method and its application in computerized tomography ⋮ A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Notes on flexible sequential block iterative methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
• Convergence of sequential and asynchronous nonlinear paracontractions
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Convergence and perturbation resilience of dynamic string-averaging projection methods
• Family constraining of iterative algorithms
• On Diagonally Relaxed Orthogonal Projection Methods
• Properties of a class of block-iterative methods
• Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction

This page was built for publication: Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings