|
Title
|
A string averaging method based on strictly quasi-nonexpansive operators with generalized relaxation
|
|
Type
|
JournalPaper
|
|
Keywords
|
convex feasibility problem; cutter operator; strictly quasinonexpansive; string averaging; generalized relaxation; extrapolation.
|
|
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
|
|
Researchers
|
Mahdi Mirzapour (Second Researcher), Touraj Nikazad (First Researcher)
|