A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications (Q1736849)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications |
scientific article; zbMATH DE number 7042384
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications |
scientific article; zbMATH DE number 7042384 |
Statements
A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications (English)
0 references
26 March 2019
0 references
Summary: In this paper, we present a new iterative scheme for finding a common element of the solution set \(\mathcal F\) of the split feasibility problem and the fixed point set \(F(T)\) of a right Bregman strongly quasi-nonexpansive mapping \(T\) in \(p\)-uniformly convex Banach spaces which are also uniformly smooth. We prove strong convergence theorem of the sequences generated by our scheme under some appropriate conditions in real \(p\)-uniformly convex and uniformly smooth Banach spaces. Furthermore, we give some examples and applications to illustrate our main results in this paper. Our results extend and improve the recent ones of some others in the literature.
0 references
right Bregman strongly quasi-nonexpansive
0 references
split feasibility problem
0 references
fixed point
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9164727
0 references
0 references
0.9088132
0 references
0.9076673
0 references
0.9035003
0 references
0.90316385
0 references
0.9028783
0 references
0.90147233
0 references