Adrian Petrusel

Learn More
Let E be a real Banach space, {Ti}i=1 be a finite family of continuous pseudocontractive self mappings of E and G : E → E be a mapping which is both δ -strongly accretive and λ -strictly pseudocontractive of Browder-Petryshyn type such that δ + λ 1 . We propose a new implicit iteration scheme with perturbed mapping G for the approximation of common fixed(More)
The first purpose of this paper is to prove an existence and uniqueness result for the multivariate fixed point of a contraction type mapping in complete metric spaces. The proof is based on the new idea of introducing a convenient metric space and an appropriate mapping. This method leads to the changing of the non-self-mapping setting to the self-mapping(More)
In this paper we will present an abstract point of view on iterative approximation schemes of fixed points for multivalued operators. More precisely, we suppose that the algorithms are convergent and we will study the impact of this hypothesis in the theory of operatorial inclusiosns: data dependence, stability and Gronwall type lemmas. Some open problems(More)
In this paper, we consider the split feasibility problem (SFP) in infinite-dimensional Hilbert spaces, and study the relaxed implicit extragradient-like methods for finding a common element of the solution set Γ of the SFP and the set Fix(S) of fixed points of a nonexpansive mapping S. Combining Mann’s implicit iterative method and Korpelevich’s(More)
*Correspondence: petrusel@math.ubbcluj.ro 1Faculty of Mathematics and Computer Science, Babeş-Bolyai University Cluj-Napoca, Kogălniceanu Street, No. 1, Cluj-Napoca, Romania Full list of author information is available at the end of the article Abstract The aim of this paper to present fixed point results for single-valued operators in b-metric spaces. The(More)
Let X, Y be two nonempty sets and s, t : X → Y be two single-valued operators. By definition, a solution of the coincidence problem for s and t is a pair (x∗, y∗) ∈ X × Y such that s(x∗) = t(x∗) = y∗. It is well-known that a coincidence problem is, under appropriate conditions, equivalent to a fixed point problem for a single-valued operator generated by s(More)