Back to Search
Start Over
A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications.
- Source :
- Fixed Point Theory & Applications; 8/1/2020, Vol. 2020 Issue 1, p1-17, 17p
- Publication Year :
- 2020
-
Abstract
- An inertial iterative algorithm for approximating a point in the set of zeros of a maximal monotone operator which is also a common fixed point of a countable family of relatively nonexpansive operators is studied. Strong convergence theorem is proved in a uniformly convex and uniformly smooth real Banach space. This theorem extends, generalizes and complements several recent important results. Furthermore, the theorem is applied to convex optimization problems and to J-fixed point problems. Finally, some numerical examples are presented to show the effect of the inertial term in the convergence of the sequence of the algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 16871820
- Volume :
- 2020
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Fixed Point Theory & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 144870062
- Full Text :
- https://doi.org/10.1186/s13663-020-00678-w