Generalized over-relaxed proximal algorithm based on A-maximal monotonicity framework and applications to inclusion problems

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 6
Cited 0

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

Mathematical Programming: Series A and B
The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem

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
Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity

Mathematics of Operations Research
A new system of variational inclusions with (H, η)-monotone operators in hilbert spaces

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.98

Visualization

Abstract

General framework for the over-relaxed proximal point algorithm using the notion of A-maximal monotonicity (also referred to as A-monotonicity in the literature) 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 auxiliary results involving A-maximal monotone mappings in a Hilbert space setting.