Let (f : Erightarrow E) be a fixed contractive mapping with coefficient (k in 0,1)) and (T: E rightarrow E) be any strongly positive linear bounded operator with coefficient γ̅.
Let (f : E rightarrow E) be a fixed contractive mapping with coefficient (k in (0,1)), (T: E rightarrow E) be a strongly positive linear bounded operator with coefficient (overline{gamma}) and (U : E rightarrow E) be a nonexpansive mapping.
Let (f : L^{2}(Omega)rightarrow L^{2}(Omega)) be a fixed contractive mapping with coefficient (k in (0,1)) and (T: L^{2}(Omega) rightarrow L^{2}(Omega)) be a strongly positive linear bounded operator with coefficient (overline{gamma}).
Consider the iterative method that generates the sequence by the algorithm where and are two sequences satisfying certain conditions, denotes the resolvent for, and let be a fixed contractive mapping.
Let (f : H_{L}^{1}(Omega) rightarrow H_{L}^{1}(Omega)) be a fixed contractive mapping with coefficient (k in (0,1)), (T: H_{L}^{1}(Omega) rightarrow H_{L}^{1}(Omega)) be a strongly positive linear bounded operator with coefficient (overline{gamma}).
Let (f: Xrightarrow X) be a fixed contractive mapping with coefficient (k in 0,1)) and (W_{i}: X rightarrow X) be (mu_{i} -strictly pseudo-contractive mu_{i} -strictlymma_{i})-strongly accretive mappings with (mu_{i}+gamma_{i} > 1) for (iin N).
An element is said to be a couple fixed point of the mapping if (2.2).
Let C be a bounded closed convex subset of a Hilbert space H with (D= operatorname {diam}C =sup_{x,yin C}Vert x-yVert < infty), and let (T Cto H) be a nonexpansive mapping having a fixed point.
In general, the optimization problem with varying unit load demand cannot be solved using a fixed nonlinear mapping.
For each, let be a nonlinear mapping and fixed positive real numbers.
