Generalized Strong Convergence Algorithm Using Bregman Distance for Solving Equilibrium and Fixed-Point Problems in Banach and Hilbert Spaces

This paper presents dual new algorithms for answering the Equilibrium Problem and Fixed Point Problems in Banach spaces. By operating the Bregman distance, we make a sweeping statement projection-based ways to unimpressed boundaries in non-Euclidean spaces, mainly in instances where conventional ideas of Lipschitz continuity or monotonicity are restrictive. The firstly algorithm services the generalized resolvent operator and Bregman projections in reflexive Banach spaces, founding strong coming together below relaxed settings. The next algorithm, planned for Hilbert spaces, integrates mistake open-mindedness machineries to confirm constancy in the attendance of computational perturbations.