A generalized contraction proximal point algorithm with two monotone operators

In this work, we introduce a generalized contraction proximal point algorithm and use it to approximate common zeros of maximal monotone operators A and B in a real Hilbert space setting. The algorithm is a two step procedure that alternates the resolvents of these operators and uses general assumptions on the parameters involved. For particular cases, these relaxed parameters improve the convergence rate of the algorithm. A strong convergence result associated with the algorithm is proved under mild conditions on the parameters. Our main result improves and extends several results in the literature.Mathematics Subject Classification (2010): 47J25, 47H05, 47H09.Keywords: Maximal monotone operator, contraction proximal point algorithm, alternating method, nonexpansive map, resolvent operator