A general framework for a relaxed proximal point algorithm using the notion of A-maximal accretive is developed. Convergence analysis for this algorithm in the context of solving a class of inclusion problems is explored along with some results on the resolvent operator corresponding to A-maximal accretive mappings.
