“…x 0 ∈ C, y n = J −1 (α n Jx n + (1 − α n )JT x n ), C n = {v ∈ C : φ (v, y n ) ≤ φ (v, x n )} , Q n = {v ∈ C : Jx 0 − Jx n , x n − v ≥ 0} , x n+1 = Π C n Q n x 0 , n ≥ 0. This algorithm has been modified and generalized for finding a common fixed point of a finite or infinite family of relatively nonexpansive mappings by several authors, such as Takahashi et al [29], Takahashi and Zembayashi [30], Wang and Xuan [32], Reich and Sabach [24,25], Kang, Su, and Zhang [13], Plubtieng and Ungchittrakool [22], etc... In 2011, Liu [20] introduced the following cyclic method for a finite family of relatively nonexpansive mappings:…”