Abstract
We study the convergence of an iterative algorithm for finding common fixed points of finitely many Bregman firmly nonexpansive operators in reflexive Banach spaces. Our algorithm is based on the concept of the so-called shrinking projection method and it takes into account possible computational errors. We establish a strong convergence theorem and then apply it to the solution of convex feasibility and equilibrium problems, and to finding zeroes of two different classes of nonlinear mappings.
| Original language | English |
|---|---|
| Pages (from-to) | 101-116 |
| Number of pages | 16 |
| Journal | Journal of Fixed Point Theory and Applications |
| Volume | 9 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2011 |
Keywords
- Banach space
- Bregman distance
- Bregman firmly nonexpansive operator
- Bregman inverse strongly monotone mapping
- Bregman projection
- Convex feasibility problem
- Equilibrium problem
- Fixed point
- Iterative algorithm
- Legendre function
- Monotone mapping
- Totally convex function
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Geometry and Topology
- Applied Mathematics