Abstract

We propose splitting, parallel algorithms for solving strongly equilibrium problems over the intersection of a finite number of closed convex sets given as the fixed-point sets of nonexpansive mappings in real Hilbert spaces. The algorithm is a combination between the gradient method and the Mann-Krasnosel’skii iterative scheme, where the projection can be computed onto each set separately rather than onto their intersection. Strong convergence is proved. Some special cases involving bilevel equilibrium problems with inverse strongly monotone variational inequality, monotone equilibrium constraints and maximal monotone inclusions are discussed. An illustrative example involving a system of integral equations is presented.

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