نتایج جستجو برای: nonexpansive
تعداد نتایج: 2607 فیلتر نتایج به سال:
In this paper, two examples of quasi-firmly type nonexpansive mappings are given to prove that the concept is different from nonexpansive mapping. Furthermore, it is studied to the convergence of the sequence of successive approximations for this class of mappings only when the super limit of iteration coefficients is less than 1. In particular, the Picard iteration {T x0} of such a mapping con...
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly closed, convex and bounded subset of a computable real Hilbert space are precisely the nonempty, co-r.e. weakly closed, convex subsets of the domain. A unif...
This paper is concerned with an ergodic theorem for asymptotically nonexpansive mappings in the intermediate sense in Banach spaces.
Let X be a real Banach space, C a nonempty closed convex subset of X, and T : C → C a mapping. Recall that T is nonexpansive if ‖Tx − Ty‖ ≤ ‖x − y‖ for all x, y ∈ C. Let Ti : C → C, i 1, 2, . . . , r, be nonexpansive mappings. Let Fix Ti denote the fixed points set of Ti, that is, Fix Ti : {x ∈ C : Tix x}, and let F : ⋂r i 1Fix Ti . For a given x1 ∈ C, and a fixed r ∈ N N denote the set of all ...
In this paper we study new algorithmic structures with DouglasRachford (DR) operators to solve convex feasibility problems. We propose to embed the basic two-set-DR algorithmic operator into the String-Averaging Projections (SAP) and into the Block-Iterative Projection (BIP) algorithmic structures, thereby creating new DR algorithmic schemes that include the recently proposed cyclic DouglasRach...
LetH be a real Hilbert space with inner product 〈·, ·〉 and norm ‖ · ‖, and let C be a nonempty closed convex subset of H. Recall that a mapping T : H → H is said to be nonexpansive if ‖Tx−Ty‖ ≤ ‖x−y‖ for all x, y ∈ H. The set of fixed points of T is Fix T : {x ∈ H : Tx x}. T : H → H is said to be quasi-nonexpansive if Fix T is nonempty and ‖Tx − p‖ ≤ ‖x − p‖ for all x ∈ H and p ∈ Fix T . Given ...
We introduce methods which seem to be a new and promising tool in hierarchical fixedpoint problems. The goal of this note is to analyze the convergence properties of these new types of approximating methods for fixed-point problems. The limit attained by these curves is the solution of the general variational inequality, 0 ∈ (I −Q)x∞ +NFixP(x∞), where NFixP denotes the normal cone to the set of...
The purpose of this paper is to study the strong convergence of a hybrid iterative scheme for finding a common element of the set of a general system of variational inequalities for α-inversestrongly monotone mapping and relaxed (c,d)cocoercive mapping, the set of solutions of a mixed equilibrium problem and the set of common fixed points of a finite family of nonexpansive mappings in a real Hi...
We study the strong convergence of two kinds of viscosity iteration processes for approximating common fixed points of the pseudocontractive semigroup in uniformly convex Banach spaces with uniformly Gâteaux differential norms. As special cases, we get the strong convergence of the implicit viscosity iteration process for approximating common fixed points of the nonexpansive semigroup in Banach...
The asymptotically nonexpansive mappings have been introduced by Goebel and Kirk in 1972. Since then, a large number of authors have studied the weak and strong convergence problems of the iterative algorithms for such a class of mappings. It is well known that the asymptotically nonexpansive mappings is a proper subclass of the class of asymptotically pseudocontractive mappings. In the present...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید