|
Title
|
Generalized relaxation of string averaging operators based on strictly relaxed cutter operator
|
|
Type
|
JournalPaper
|
|
Keywords
|
convex feasibility problem, relaxed cutter operator, strictly quasi-nonexpansive operator, string averaging, generalized relaxation
|
|
Abstract
|
We present convergence analysis of a generalized relaxation of string averaging operators which is based on strictly relaxed cutter operators on a general Hilbert space. In this paper, the string averaging operator is assembled by averaging of strings’ endpoints and each string consists of composition of finitely many strictly relaxed cutter operators. We also consider projected version of the generalized relaxation of string averaging operator. To evaluate the study, we recall a wide class of iterative methods for solving linear equations (inequalities) and use the subgradient projection method for solving nonlinear convex feasibility problems.
|
|
Researchers
|
Touraj Nikazad (First Researcher), Mahdi Mirzapour (Second Researcher)
|