Perturbation-resilient iterative methods with an infinite pool of mappings
DOI10.1137/14095724XzbMATH Open1321.47147OpenAlexW2022330448MaRDI QIDQ2946212FDOQ2946212
Touraj Nikazad, Mokhtar Abbasi
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
Recommendations
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Perturbation resilience and superiorization methodology of averaged mappings
- Convergence to approximate solutions and perturbation resilience of iterative algorithms
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- On finitely convergent iterative methods for the convex feasibility problem
projection methodsconvex feasibilitynonexpansive operatorsblock-iterative methodsstring-averagingparacontracting operators
Iterative numerical methods for linear systems (65F10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Perturbations of nonlinear operators (47H14)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Averaging strings of sequential iterations for convex feasibility problems.
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Diagonally Relaxed Orthogonal Projection Methods
- 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
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Convergence of sequential and asynchronous nonlinear paracontractions
- Properties of a class of block-iterative methods
- Family constraining of iterative algorithms
Cited In (6)
- String-averaging algorithms for convex feasibility with infinitely many sets
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation
- A new step size rule for the superiorization method and its application in computerized tomography
- Notes on flexible sequential block iterative methods
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
This page was built for publication: Perturbation-resilient iterative methods with an infinite pool of mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946212)
