๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A remark on the boundness and weak convergence of general proximal point algorithm

โœ Scribed by Zhenyu Huang

Publisher
Springer
Year
2010
Tongue
English
Weight
120 KB
Volume
15
Category
Article
ISSN
1385-1292

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

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