𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the convergence rate of the over-relaxed proximal point algorithm

✍ Scribed by Zhenyu Huang; Muhammad Aslam Noor

Book ID
116217569
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
190 KB
Volume
25
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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 Proximal Point Algorithm
On the Proximal Point Algorithm
✍ B. DjafariΒ Rouhani; H. Khatibzadeh πŸ“‚ Article πŸ“… 2007 πŸ› Springer 🌐 English βš– 225 KB