Abstract

We study one property of Bregman projection onto closed convex sets
in Banach spaces. As an application, we use this property to
simplify a class of hybrid algorithms for finding fixed points of
nonlinear mappings and solving convex feasibility, variational
inequality and equilibrium problems. This will reduce the
computational complexity.

This work is licensed under a Creative Commons Attribution 4.0 License.