Abstract
First, a general framework for the over-relaxed A -proximal point algorithm based on the A -maximal monotonicity is introduced, and second it is applied to the approximation solvability of a general class of nonlinear inclusion problems using the generalized resolvent operator technique. The over-relaxed A -proximal point algorithm is of interest in the sense that it is quite application-oriented, but nontrivial in nature. The results obtained are general in nature.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
