Perturbation-resilient iterative methods with an infinite pool of mappings

DOI10.1137/14095724XMaRDI QIDQ2946212zbMATH OpenOpenAlexFDO

Authors 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

projection methodsconvex feasibilitynonexpansive operatorsblock-iterative methodsstring-averagingparacontracting operators

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3238721 (Why is no real title available?)
• Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
• Averaging strings of sequential iterations for convex feasibility problems.
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Convergence and perturbation resilience of dynamic string-averaging projection methods
• Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
• Convergence of sequential and asynchronous nonlinear paracontractions
• Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces
• Family constraining of iterative algorithms
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
• On Diagonally Relaxed Orthogonal Projection Methods
• On Projection Algorithms for Solving Convex Feasibility Problems
• Properties of a class of block-iterative methods

Cited in

(10)

• 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
• A new step size selection strategy for the superiorization methodology using subgradient vectors and its application for solving convex constrained optimization problems
• Biased superiorization of steepest descent: redefining the reconstruction target in noisy inverse problems
• An accelerated version of block cyclic subgradient projection method for solving convex feasibility problems
• 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
• Convergence properties of dynamic string-averaging projection methods in the presence of perturbations

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)