Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation

Abstract

We examine some bounded perturbations resilient iterative methods for addressing (constrained) consistent linear systems of equations and (constrained) least squares problems. We introduce multiple frameworks rooted in the operator of the Landweber iteration, adapting the operators to facilitate the minimization of absolute errors or residuals. We demonstrate that our operator-based methods exhibit comparable speed to powerful methods like CGLS, and we establish that the computational cost of our methods is nearly equal to that of CGLS. Furthermore, our methods possess the capability to handle constraints (e.g. non-negativity) and control the semi-convergence phenomenon. In addition, we provide convergence analysis of the methods when the current iterations are perturbed by summable vectors. This allows us to utilize these iterative methods for the superiorization methodology. We showcase their performance using examples drawn from tomographic imaging and compare them with CGLS, superiorized conjugate gradient (S-CG), and the non-negative flexible CGLS (NN-FCGLS) methods.