The over-relaxed proximal point algorithm based on H H -maximal monotonicity design and applications
First the general framework for a generalized over-relaxed proximal point algorithm using the notion of H H -maximal monotonicity (also referred to as H H -monotonicity) is developed, and then the convergence analysis for this algorithm in the context of solving a general class of nonlinear inclusion problems is examined along with some auxiliary results on the resolvent operators corresponding to H H -maximal monotonicity.
variational inclusions maximal monotone mapping h h -maximal monotone mapping h h h h h generalized resolvent operator