In this paper, we study generalized multiple-set split feasibility problems (in short, GMSSFP)
in the frame work of p-uniformly convex real Banach spaces which are also uniformly smooth.
We construct an iterative algorithm which is free from an operator norm and prove its strong
convergence to a solution of GMSSFP, that is, a solution of convex problem and
a common fixed point of a countable family of Bregman asymptotically quasi-nonexpansive mappings
without requirement for semi-compactness on the mappings. We illustrate our algorithm and convergence result by a numerical example.
An iterative method for solving multiple-set split feasibility problems in Banach spaces
Al-Homidan, S., Ali, B. and Suleiman, Y. I.
Abstract
carpathian_2020_36_1_01_13_abstractFull PDF
carpathian_2020_36_1_01_13Additional Information
| Author(s) | Ali, B., Al-Homidan, S., Suleiman, Y. I. |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2020.01.01 |
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration