✦ LIBER ✦

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

✍ Scribed by Ram U. Verma

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 213 KB
Volume: 55
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.10.025

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

Generalized Eckstein–Bertsekas proximal

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

✍ Rom U. Verma 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 350 KB

General over-relaxed proximal point algo

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

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

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

A remark on the strong convergence of th

A remark on the strong convergence of the over-relaxed proximal point algorithm

✍ Zhenyu Huang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 233 KB

This paper illustrates that the conditions and the main proof of two main theorems of Verma [R.U. Verma, The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications, Computers and Mathematics with Applications 55 (2008) 2673-2679] concerning the strong convergen

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