Weak and strong convergence for some generalized proximal point algorithms are proved. These algorithms include the Eckstein and Bertsekas generalized proximal point algorithm, a contraction-proximal point algorithm, and inexact proximal point algorithms. Convergence rate is also considered.
We establish a Banach space version of a theorem of Suzuki [8]. More precisely we prove that if X is a uniformly convex Banach space with a weakly continuous duality map (for example, lp for 1 < p < ∞), if C is a closed convex subset of X, and if F = {T (t): t ≥ 0} is a contraction semigroup on C such that Fix(F) ≠ ∅, then under certain appropriate assumptions made on the sequences {αn} and {tn} of the parameters, we show that the sequence {xn} implicitly defined by for all n ≥ 1 converges strongly to a member of Fix(F).
1 January 2006 in Bulletin of the Australian Mathematical Society
Consider a nonexpansive self-mapping T of a bounded closed convex subset of a Banach space. Banach's contraction principle guarantees the existence of approximating fixed point sequences for T. However such sequences may not be strongly convergent, in general, even in a Hilbert space. It is shown in this paper that in a real smooth and uniformly convex Banach space, appropriately constructed approximating fixed point sequences can be strongly convergent.
1 December 2004 in Bulletin of the Australian Mathematical Society
A contractive mapping on a complete metric space may fail to have a fixed point. Diametrically contractive mappings are introduced and it is shown that a diametrically contractive self-mapping of a weakly compact subset of a Banach space always has a fixed point.