Abstract
AbstractIn this paper, we introduce and study a modified Halpern-type proximal point algorithm which comprises a finite family of resolvents of mixed equilibrium problems and a finite family of k-demimetric mappings. We prove that the algorithm converges strongly to a common solution of a finite family of mixed equilibrium problems, which is also a common fixed point of a finite family of k-demimetric mappings in a Hadamard space. Furthermore, we give a numerical example of our algorithm to show the applicability of our algorithm.
Publisher
Springer Science and Business Media LLC
Reference42 articles.
1. Abass, H.A.; Okeke, C.C.; Mewomo, O.T.: On split equality mixed equilibrium and fixed point problems for countable families of generalized $$K_I$$-strictly pseudo-contractive multivalued mappings. Dyn. Contin. Discret. Impulsive Syst. Ser. B Appl. Algorithms 25, 369–395 (2018)
2. Aremu, K.O.; Izuchukwu, C.; Mebawondu, A.A.; Mewomo, O.T.: A viscosity-type proximal point algorithm for monotone equilibrium problem and fixed point problem in an Hadamard space. Asian Eur. J. Math. 2150058, 24 (2020). https://doi.org/10.1142/S1793557121500583
3. Aremu, K.O.; Izuchukwu, C.; Ugwunnadi, G.C.; Mewomo, O.T.: On the proximal point algorithm and demimetric mappings in CAT(0) spaces. Demonstr. Math. 51, 277–294 (2018)
4. Bacak, M.: The proximal point algorithm in metric spaces. Israel J. Math. 194(2), 689–701 (2013)
5. Bianchi, M.; Schaible, S.: Generalized monotone bifunctions and equilibrium problems. J. Optim. Theory Appl. 90, 31–43 (1996)