The generalized relaxed proximal point algorithm involving -maximal-relaxed accretive mappings with applications to Banach spaces

A general design for the relaxed proximal point algorithm using the notion of A -maximal-relaxed accretiveness 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 other results of interest involving A -maximal-relaxed accretive mappings in a real Banach space setting.