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

by   Touraj Nikazad, et al.

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.


page 1

page 2

page 3

page 4


Uniform approximation by multivariate quasi-projection operators

Approximation properties of quasi-projection operators Q_j(f,φ, φ) are s...

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

In this paper, we analyze the convergence projected non-stationary bloc...

The linearization methods as a basis to derive the relaxation and the shooting methods

This chapter investigates numerical solution of nonlinear two-point boun...

Perturbation Resilience and Superiorization of Iterative Algorithms

Iterative algorithms aimed at solving some problems are discussed. For c...

A generalized projection iterative methods for solving non-singular linear systems

In this paper, we propose and analyze iterative method based on projecti...

The α-divergences associated with a pair of strictly comparable quasi-arithmetic means

We generalize the family of α-divergences using a pair of strictly compa...

On the Adimensional Scale Invariant Steffensen (ASIS) Method

Dimensionality of parameters and variables is a fundamental issue in phy...