𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Ram U. Verma

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
467 KB
Volume
49
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The over-relaxed proximal point algorith
The over-relaxed proximal point algorithm based on -maximal monotonicity design and applications
✍ Ram U. Verma πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 213 KB

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 pr

General system of -maximal relaxed monot
General system of -maximal relaxed monotone variational inclusion problems based on generalized hybrid algorithms
✍ Ravi P. Agarwal; Ram U. Verma πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 307 KB

In this paper, a new system of nonlinear (set-valued) variational inclusions involving ðA; gÞmaximal relaxed monotone and relative ðA; gÞ-maximal monotone mappings in Hilbert spaces is introduced and its approximation solvability is examined. The notion of ðA; gÞmaximal relaxed monotonicity generali