On general over-relaxed proximal point algorithm and applications
Ram U. Verma · Optimization · 2010
A general framework to the over-relaxed proximal point algorithm based on H-maximal monotonicity is introduced, and then it is applied to the approximation solvability of a general class of nonlinear inclusion problems based on the generalized resolvent operator technique. This form of the proximal point algorithm seems to be more application-oriented to inclusion problems.