A hybrid inertial algorithm for approximating solution of convex feasibility problems with applications

Fixexd point theory and applications

article

Chidume, Charles E.¹  Kumam, Poom²  Adamu, Abubakar¹ 

[1] African University of Science and Technology;Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Science Laboratory Building, King Mongkuts University of Technology Thonburi (KMUTT)

关键词: Inertial;    Maximal monotone;    Fixed point;    Hybrid;   

DOI  :  10.1186/s13663-020-00678-w

来源: SpringerOpen

【 摘 要 】

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.

【 授权许可】

Unknown