Fixed point results for generalized convex orbital Lipschitz operators
Demonstratio MathematicaKrasnoselskii’s iteration is a classical and important method for approximating the fixed point of an operator that satisfies certain conditions. Many authors have used this approach to obtain several famous fixed point theorems for different types of ...
Zhou Mi +4 more
doaj +1 more source
The regularized CQ algorithm without a priori knowledge of operator norm for solving the split feasibility problem. [PDF]
J Inequal Appl, 2017 Tian M, Zhang HF.
europepmc +1 more source
A note on "Implicit iterative process with errors". [PDF]
Springerplus, 2016 Yolacan E.
europepmc +1 more source
On compositions of special cases of Lipschitz continuous operators. [PDF]
Fixed Point Theory Algorithm Sci Eng, 2021 Giselsson P, Moursi WM.
europepmc +1 more source
The modified proximal point algorithm in Hadamard spaces. [PDF]
J Inequal Appl, 2018 Chang SS, Wang L, Wen CF, Zhang JQ.
europepmc +1 more source
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem. [PDF]
J Inequal Appl, 2017 Tian M, Zhang HF.
europepmc +1 more source
A modified viscosity implicit-type proximal point algorithm for monotone inclusions and asymptotically nonexpansive mappings in Hadamard spaces. [PDF]
J Inequal Appl, 2018 Chang SS, Yao JC, Wen CF, Wang L.
europepmc +1 more source
New construction and proof techniques of projection algorithm for countable maximal monotone mappings and weakly relatively non-expansive mappings in a Banach space. [PDF]
J Inequal Appl, 2018 Wei L, Agarwal RP.
europepmc +1 more source
On an open question of V. Colao and G. Marino presented in the paper "Krasnoselskii-Mann method for non-self mappings". [PDF]
Springerplus, 2016 Guo M, Li X, Su Y.
europepmc +1 more source