Strong convergence theorems for strictly pseudocontractive mappings of Browder--Petryshyn type (Q2472557)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strong convergence theorems for strictly pseudocontractive mappings of Browder--Petryshyn type |
scientific article |
Statements
Strong convergence theorems for strictly pseudocontractive mappings of Browder--Petryshyn type (English)
0 references
22 February 2008
0 references
This article deals with the iteration scheme \[ x_{n+1} = (1 - \alpha_n)x_n + \alpha_n Ty_n + u_n, \quad y_n = (1 - \beta_n)x_n + \beta_nTx_n, \qquad n = 1,2,\dots, \] where \(T : K \to K\) is a strictly pseudocontractive mapping with \(\text{Fix} \, T \neq \emptyset\), \(K\) is a nonempty closed convex subset of a real \(q\)-uniformly smooth Banach space \(E\) (\(q > 1\)), \(K + K \subset K\), \(u_n\) is a bounded sequence in \(K\), \((\alpha_n), (\beta_n)\) are sequences in \([0,1]\), and the following conditions are satisfied: \(\sum_{n=1}^\infty \| u_n\| < \infty\), \(\alpha_n \leq \lambda (q / c_q)^{1/(q-1)}\), \(\sum_{n=1}^\infty \beta_n^\tau < \infty\) (\(\tau = \min \;\{1,(q - 1)\}\)). Recall that a mapping \(T\) with domain \(D(T)\) is called strictly pseudocontractive if there exists \(\lambda > 0\) such that for all \(x, y \in D(T)\) there exists \(j \in J(x - y)\) satisfying \[ \langle (I - T)x - (I - T)y,j \rangle \geq \lambda \| (I - T)x - (I - T)y\| ^2; \] here \(J\) is the normalized duality (multi)mapping. The constant \(c_q\) is a minimal constant for which the inequality \(\| x + y\| ^q \leq \| x\| ^q + q \langle y,J_q(x) \rangle + c_q\| y\| ^q\) holds. The main result is that the iterates \((x_n)\) converge strongly to a fixed point of \(T\) if and only if \((x_n0\) is bounded and \(\liminf_{n\to\infty}d(x_n,\text{Fix}\,T)=0\).
0 references
fixed point
0 references
strictly pseudocontractive mapping
0 references
Ishikawa iterative process with errors
0 references
\(q\)-uniformly smooth Banach space
0 references