The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications

Authors:
Ram U. Verma
Affiliations:
International Publications, 12085 Lake Cypress Circle, Suite I109, Orlando, FL 32828, USA
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 6
Cited 2

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

Generalized Eckstein-Bertsekas proximal point algorithm based on A-maximal monotonicity design

Computers & Mathematics with Applications
A remark on the strong convergence of the over-relaxed proximal point algorithm

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

First the general framework for a generalized over-relaxed proximal point algorithm using the notion of H-maximal monotonicity (also referred to as H-monotonicity) 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 on the resolvent operators corresponding to H-maximal monotonicity.