we prove a strong convergence result for a sequence generated by halpern's type iteration for approximating a common fixed point of a countable family of quasi-lipschitzian mappings in a real hilbert space. consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

in this paper, we shall introduce the fuzzyw-distance, then prove a common fixed point theorem with respectto fuzzy w-distance for two mappings under the condition ofweakly compatible in complete fuzzy metric spaces.

In this paper, we introduce the concept of a w-compatible mappings and utilize the same to discuss the ideas of coupled coincidence point and coupled point of coincidence for nonlinear contractive mappings in the context of complex valued metric spaces besides proving existence theorems which are following by corresponding unique coupled common fixed point theorems for such mappings. Some illus...

where U : H1 → H1 and T : H2 → H2 are two firmly quasi-nonexpansive operators with nonempty fixed-point sets F(U) = {x ∈ H1 : Ux = x} and F(T ) = {x ∈ H2 : Tx = x}. Note that by taking H2 = H3 and B = I, we recover the split common fixed-point problem originally introduced in Censor and Segal (J. Convex Anal. 16:587-600, 2009). In this paper, we will continue to consider the split common fixed-...

We prove a strong convergence result for a sequence generated by Halpern's type iteration for approximating a common fixed point of a countable family of quasi-Lipschitzian mappings in a real Hilbert space. Consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

We present the PFix algorithm for the fixed point problem f ðxÞ 1⁄4 x on a nonempty domain 1⁄2a; b ; where dX1; a; bAR ; and f is a Lipschitz continuous function with respect to the infinity norm, with constant qp1: The computed approximation x̃ satisfies the residual criterion jj f ðx̃Þ x̃jjNpe; where e40: In general, the algorithm requires no more than Pd i1⁄41s i function component evaluations,...