نتایج جستجو برای: nonexpansive
تعداد نتایج: 2607 فیلتر نتایج به سال:
we introduce an implicit method for nding a common element of the set of solutions of systems of equilibrium problems and the set of common xed points of a sequence of nonexpansive mappings and a representation of nonexpansive mappings. then we prove the strong convergence of the proposed implicit schemes to the unique solution of a variational inequality, which is the optimality condition fo...
We prove that the set of common fixed points of a given countable family of relatively nonexpansive mappings is identical to the fixed-point set of a single strongly relatively nonexpansive mapping. This answers Kohsaka and Takahashi’s question in positive. We also introduce the concept of strongly generalized nonexpansive mappings and prove the analogue version of the result above for Ibaraki-...
We consider a new type of monotone nonexpansive mappings in an ordered Banach space X with partial order . This new class of nonlinear mappings properly contains nonexpansive, firmly-nonexpansive and Suzuki-type generalized nonexpansive mappings and partially extends α-nonexpansive mappings. We obtain some existence theorems and weak and strong convergence theorems for the Mann iteration. Some ...
with kn ≥ 0, rn ≥ 0, kn → 1, rn → 0 n → ∞ , for each x, y ∈ C, n 0, 1, 2, . . . . If kn 1 and rn 0, 1.1 reduces to nonexpansive mapping; if rn 0, 1.1 reduces to asymptotically nonexpansive mapping; if kn 1, 1.1 reduces to asymptotically nonexpansive-type mapping. So, a generalized asymptotically nonexpansive mapping is much more general than many other mappings. Browder 1 introduced the followi...
We introduce a concept of weak Bregman relatively nonexpansive mapping which is distinct from Bregman relatively nonexpansive mapping. By using projection techniques, we construct several modification of Mann type iterative algorithms with errors and Halpern-type iterative algorithms with errors to find fixed points of weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpa...
In this paper, we first prove the weak convergence for the Moudafi’s iterative scheme of two quasi-nonexpansive mappings. Then we prove the weak convergence for the Moudafi’s iterative scheme of quasi-nonexpansive mapping and nonexpansive mapping. Finally, we prove the strong convergence for the Moudafi’s iterative scheme of two quasi-nonexpansive mappings. Our results generalize the recent res...
The authors have obtained the following results: 1 the definition of uniformly closed countable family of nonlinear mappings, 2 strong convergence theorem by the monotone hybrid algorithm for two countable families of hemirelatively nonexpansive mappings in a Banach space with new method of proof, 3 two examples of uniformly closed countable families of nonlinear mappings and applications, 4 an...
Let K be a nonempty closed convex subset of a reflexive real Banach space E which has a uniformly Gâteaux differentiable norm. Assume that K is a sunny nonexpansive retract of E with Q as the sunny nonexpansive retraction. Let Ti : K → E, i = 1, . . . ,r, be a family of nonexpansive mappings which are weakly inward. Assume that every nonempty closed bounded convex subset of K has the fixed poin...
In this paper, we first introduce the class of generalized nonexpansive mappings in Banach spaces. This class contains both the classes of nonexpansive and ̨-nonexpansive mappings. In addition, we obtain some fixed point and coincidence point theorems for generalized nonexpansive mappings in uniformly convex Banach spaces. Our results extend some wellknown results in literature. 2010 Mathematic...
We introduce a general implicit algorithm for finding a common element of the set of solutions of systems of equilibrium problems and the set of common fixed points of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید