✦ LIBER ✦

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

✍ Scribed by Zhenyu Huang

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 233 KB
Volume: 60
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.06.043

No coin nor oath required. For personal study only.

✦ Synopsis

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 convergence of the over-relaxed proximal point algorithm for H-maximal monotone mappings in Hilbert spaces are incorrect.

📜 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

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

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

Another version of the proximal point al

Another version of the proximal point algorithm in a Banach space

✍ Ya.I. Alber; Jen-Chih Yao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 660 KB

In this paper, we study some non-traditional schemes of proximal point algorithm for nonsmooth convex functionals in a Banach space. The proximal approximations to their minimal points and/or their minimal values are considered separately for unconstrained and constrained minimization problems on co

On the convergence of the discretized mu

On the convergence of the discretized multi-splitting waveform relaxation algorithm

✍ Bert Pohl 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 516 KB

On the strong convergence of a weighted

On the strong convergence of a weighted sum

✍ Wei Biao Wu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 69 KB

We prove the equivalence of the almost sure and complete convergence of a particular weighted sum of independent, identically distributed random variables investigated by . Limiting behavior of weighted sums of independent random variables. Ann. Probab. 1, 810 -824.