Abstract
We study the convergence of two iterative algorithms for finding common fixed points of finitely many Bregman strongly nonexpansive operators in reflexive Banach spaces. Both algorithms take into account possible computational errors. We establish two strong convergence theorems and then apply them to the solution of convex feasibility, variational inequality and equilibrium problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
