Abstract

A new relaxed algorithmic procedure based on the notion of A -maximal relaxed monotonicity is developed, and then the convergence analysis in the context of solving a general class of nonlinear inclusion problems is examined. Furthermore, some results involving A -maximal relaxed monotone mappings in a Hilbert space setting are included.

Full Text
Published version (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