Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
