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

Another version of the proximal point algorithm in a Banach space

โœ Scribed by Ya.I. Alber; Jen-Chih Yao


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
660 KB
Volume
70
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 convex closed sets. For the latter we use proximal point algorithms with the metric projection operators and first establish the estimates of the convergence rate with respect to functionals. We also investigate the perturbed projection proximal point algorithms and prove their stability. Some results concerning the classical proximal point method for minimization problems in a Banach space is also presented in this paper.


๐Ÿ“œ SIMILAR VOLUMES


An iterative algorithm based on -proxima
โœ K.R. Kazmi; M.I. Bhat; Naeem Ahmad ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 751 KB

In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasivariational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369-383], for a nonconvex, proper, lower semicontinuous and