✦ LIBER ✦

General over-relaxed proximal point algorithm involving A-maximal relaxed monotone mappings with applications

✍ Scribed by Ram U. Verma

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 345 KB
Volume: 71
Category: Article
ISSN: 0362-546X
DOI: 10.1016/j.na.2009.01.184

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The generalized relaxed proximal point a

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

✍ Ram U. Verma 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 449 KB

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

A general framework for the over-relaxed

A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems

✍ Ram U. Verma 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 399 KB

Over-relaxed A-proximal point algorithm

Generalized over-relaxed proximal algori

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

✍ Ram U. Verma 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 467 KB