نتایج جستجو برای: best proximity point
تعداد نتایج: 907097 فیلتر نتایج به سال:
The best approximation problem in a hyperconvex metric space consists of finding conditions for given set-valued mappings F andG and a setX such that there is a point x0 ∈ X satisfying d G x0 , F x0 ≤ d x, F x0 for x ∈ X. When G I, the identity mapping, and when the set X is compact, best approximation theorems for mappings in hyperconvex metric spaces are given for the single-valued case in 1–...
In this article, we introduce a new class of non-self mappings, called weak proximal contractions, which contains the proximal contractions as a subclass. Existence and uniqueness results of a best proximity point for weak proximal contractions are obtained. Also, we provide sufficient conditions for the existence of common best proximity points for two non-self mappings in metric spaces having...
In this paper, we prove new common best proximity point theorems for proximity commuting mapping by using concept of Geraghty’s theorem in complete metric spaces. Our results improve and extend recent result of Sadiq Basha [Basha, S. S., Common best proximity points: global minimization of multi-objective functions, J. Glob Optim, 54 (2012), No. 2, 367-373] and some results in the literature. A...
In this paper, we present best proximity point theorems for new class ofK−rational proximal contraction, in the setting of metric spaces. Some illustrative example are also given.
In this paper we prove existence theorems of best proximity pairs in uniformly convex spaces, using a fixed point theorem for Kakutani factorizable multi-functions.
LetA andB be two nonempty subsets of ametric space (X, d). An element x ∈ A is said to be a fixed point of a given map T : A → B ifTx = x. Clearly,T(A)∩A ̸ = 0 is a necessary (but not sufficient) condition for the existence of a fixed point of T. If T(A) ∩ A = 0, then d(x, Tx) > 0 for all x ∈ A that is, the set of fixed points of T is empty. In a such situation, one often attempts to find an ele...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید