A string averaging method based on strictly quasi-nonexpansive operators with generalized relaxation
arXiv:2104.14832
Abstract
We study a fixed point iterative method based on generalized relaxation of strictly quasi-nonexpansive operators. The iterative method is assembled by averaging of strings, and each string is composed of finitely many strictly quasi-nonexpansive operators. To evaluate the study, we examine a wide class of iterative methods for solving linear systems of equations (inequalities) and the subgradient projection method for solving nonlinear convex feasibility problems. The mathematical analysis is complemented by some experiments in image reconstruction from projections and classical examples, which illustrate the performance using generalized relaxation.
arXiv commentarXiv admin note: text overlap with arXiv:1706.06675
References in corpus (4)
- Convergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods
- Convergence Properties of Dynamic String Averaging Projection Methods in the Presence of Perturbations
- String-Averaging Expectation-Maximization for Maximum Likelihood Estimation in Emission Tomography
- Generalized relaxation of string averaging operators based on strictly relaxed cutter operators