DeepAI AI Chat
Log In Sign Up

Convergence and Semi-convergence of a class of constrained block iterative methods

by   Mahdi Mirzapour, et al.

In this paper, we analyze the convergence projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution to large linear, usually both noisy and ill-conditioned, systems of equations. We split the error of the kth iterate into noise error and iteration error, and consider each error separately. The iteration error is treated for a more general algorithm, also suited for solving split feasibility problems in Hilbert space. The results for P-BIM come out as a special case. The algorithmic step involves projecting onto closed convex sets. When these sets are polyhedral, and of finite dimension, it is shown that the algorithm converges linearly. We further derive an upper bound for the noise error of P-BIM. Based on this bound, we suggest a new strategy for choosing relaxation parameters, which assist in speeding up the reconstruction process and improving the quality of obtained images. The relaxation parameters may depend on the noise. The performance of the suggested strategy is shown by examples taken from the field of image reconstruction from projections.


The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations

The linearized Bregman method is a method to calculate sparse solutions ...

A string averaging method based on strictly quasi-nonexpansive operators with generalized relaxation

We study a fixed point iterative method based on generalized relaxation ...

Stochastic mirror descent method for linear ill-posed problems in Banach spaces

Consider linear ill-posed problems governed by the system A_i x = y_i fo...

Accelerating the Distributed Kaczmarz Algorithm by Strong Over-relaxation

The distributed Kaczmarz algorithm is an adaptation of the standard Kacz...

Scheduled Relaxation Jacobi schemes for non-elliptic partial differential equations

The Scheduled Relaxation Jacobi (SRJ) method is a linear solver algorith...

Range-relaxed criteria for choosing the Lagrange multipliers in the Levenberg-Marquardt method

In this article we propose a novel strategy for choosing the Lagrange mu...

Stability of the Kaczmarz Reconstruction for Stationary Sequences

The Kaczmarz algorithm is an iterative method to reconstruct an unknown ...