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

Authors:
Ram U. Verma
Affiliations:
International Publications (USA), 12085 Lake Cypress Circle, Suite I109, Orlando, FL 32828, USA
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2009

Citing 5
Cited 0

Inequalities in Banach spaces with applications

Nonlinear Analysis: Theory, Methods & Applications
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

Mathematical Programming: Series A and B
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings

SIAM Journal on Control and Optimization
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities

SIAM Journal on Optimization
Nonlinear relaxed cocoercive variational inclusions involving (A, η)-accretive mappings in banach spaces

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.98

Visualization

Abstract

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.