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

Error bounds for proximal point subproblems and associated inexact proximal point algorithms

โœ Scribed by M.V. Solodov; B.F. Svaiter


Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
106 KB
Volume
88
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the convergence analysis of inexact h
โœ 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