Abstract

In 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call