Iterative algorithm for common fixed points of infinite family of nonexpansive mappings in Banach spaces (Q443092): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/787419 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2042266533 / rank | |||
Normal rank |
Revision as of 00:06, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iterative algorithm for common fixed points of infinite family of nonexpansive mappings in Banach spaces |
scientific article |
Statements
Iterative algorithm for common fixed points of infinite family of nonexpansive mappings in Banach spaces (English)
0 references
6 August 2012
0 references
Summary: Let \(C\) be a nonempty closed convex subset of a real uniformly smooth Banach space \(X\), let \(\{T_k\}^\infty_{k=1} : C \rightarrow C\) be an infinite family of nonexpansive mappings with the nonempty set of common fixed points \(\bigcap^\infty_{k=1} \text{Fix}(T_k)\), and \(f : C \rightarrow C\) be a contraction. We introduce an explicit iterative algorithm \(x_{n+1} = \alpha_n f(x_n) + (1 - \alpha_n)L_nx_n\), where \(L_n = \sum^n_{k=1}(\omega_k/s_n) T_k, S_n = \sum^n_{k=1} \omega_k\), and \(w_k > 0\) with \(\sum^\infty_{k=1} \omega_k = 1\). Under certain appropriate conditions on \(\{\alpha_n\}\), we prove that \(\{x_n\}\) converges strongly to a common fixed point \(x^\ast\) of \(\{T_k\}^\infty_{k=1}\), which solves the following variational inequality: \[ \langle x^\ast - f(x^\ast), J(x^\ast - p)\rangle \leq 0, \quad p \in \bigcap^\infty_{k=1} \text{Fix}(T_k), \] where \(J\) is the (normalized) duality mapping of \(X\). This algorithm is brief and needs less computational work, since it does not involve \(W\)-mappings.
0 references
real uniformly smooth Banach space
0 references
nonexpansive mappings
0 references
explicit iterative algorithm
0 references