𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Rom U. Verma

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
350 KB
Volume
56
Category
Article
ISSN
0898-1221

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

On the convergence analysis of inexact h
On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators
✍ Lu-Chuan Ceng; Jen-Chih Yao 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 192 KB

In this paper we introduce general iterative methods for finding zeros of a maximal monotone operator in a Hilbert space which unify two previously studied iterative methods: relaxed proximal point algorithm [H.K. Xu, Iterative algorithms for nonlinear operators, J. London Math Soc. 66 (2002) 240-25