Hybrid inertial algorithm for fixed point and equilibrium problems in reflexive Banach spaces
From MaRDI portal
Publication:6180618
DOI10.24193/fpt-ro.2022.2.01OpenAlexW4365402040MaRDI QIDQ6180618
Yusuf Ibrahim, Lawal Yusuf Haruna, Bashir Ali
Publication date: 2 January 2024
Published in: Fixed Point Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.24193/fpt-ro.2022.2.01
2-generalized hybrid mappingnormally 2-generalized hybrid mappinggeneric 2-generalized Bregman nonspreading mapping2-generalized nonspreading mappingequilbrium problems
Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Cites Work
- An iterative row-action method for interval convex programming
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Applications of Bregman-Opial property to Bregman nonspreading mappings in Banach spaces
- Iterative methods for approximating fixed points of Bregman nonexpansive operators
- Attractive point and nonlinear ergodic theorems without convexity in reflexive Banach spaces
- Bregman weak relatively nonexpansive mappings in Banach spaces
- Iterative approximations of attractive point of a new generalized Bregman nonspreading mapping in Banach spaces
- Existence theorems for attractive points of semigroups of Bregman generalized nonspreading mappings in Banach spaces
- Approximating common fixed points of Bregman weakly relatively nonexpansive mappings in Banach spaces
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- WEAK CONVERGENCE THEOREMS FOR 2-GENERALIZED HYBRID MAPPINGS AND EQUILIBRIUM PROBLEMS
- Gradients of Convex Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item