Products of Finitely Many Resolvents of Maximal Monotone Mappings in Reflexive Banach Spaces

Shoham Sabach · SIAM Journal on Optimization · 2011

We propose two algorithms for finding (common) zeros of finitely many maximal monotone mappings in reflexive Banach spaces. These algorithms are based on the Bregman distance related to a well-chosen convex function and improve previous results. Finally, we mention two applications of our algorithms for solving equilibrium problems and convex feasibility problems.

Read the paper · More papers on PaperTik