Skip to main content

A new method for the research of best proximity point theorems of nonlinear mappings

Abstract

The purpose of this paper is to present a new method for the research of best proximity point theorems of nonlinear mappings in metric spaces. In this paper, the P-operator technique, which changes non-self-mapping to self-mapping, provides a new and simple method of proof. Best proximity point theorems for weakly contractive and weakly Kannan mappings, generalized best proximity point theorems for generalized contractions, and best proximity points for proximal cyclic contraction mappings have been proved by using this new method. Meanwhile, many recent results in this area have been improved.

MSC:47H05, 47H09, 47H10.

1 Introduction and preliminaries

Several problems can be changed to equations of the form Tx=x, where T is a given self-mapping defined on a subset of a metric space, a normed linear space, a topological vector space or some suitable space. However, if T is a non-self-mapping from A to B, then the aforementioned equation does not necessarily admit a solution. In this case, one would contemplate finding an approximate solution x in A such that the error d(x,Tx) is minimum, where d is the distance function. In view of the fact that d(x,Tx) is at least d(A,B), a best proximity point theorem (for short BPPT) guarantees the global minimization of d(x,Tx) by the requirement that an approximate solution x satisfies the condition d(x,Tx)=d(A,B). Such optimal approximate solutions are called best proximity points of the mapping T. Interestingly, best proximity point theorems also serve as a natural generalization of fixed point theorems, for a best proximity point becomes a fixed point if the mapping under consideration is a self-mapping. Research on the best proximity point is an important topic in the nonlinear functional analysis and applications (see [1–18]).

Let A, B be two nonempty subsets of a complete metric space and consider a mapping T:A→B. The best proximity point problem is whether we can find an element x 0 ∈A such that d( x 0 ,T x 0 )=min{d(x,Tx):x∈A}. Since d(x,Tx)≥d(A,B) for any x∈A, in fact, the optimal solution to this problem is the one for which the value d(A,B) attained.

Let A, B be two nonempty subsets of a metric space (X,d). We denote by A 0 and B 0 the following sets:

A 0 = { x ∈ A : d ( x , y ) = d ( A , B )  for some  y ∈ B } , B 0 = { y ∈ B : d ( x , y ) = d ( A , B )  for some  x ∈ A } ,

where d(A,B)=inf{d(x,y):x∈A and y∈B}.

It is interesting to notice that A 0 and B 0 are contained in the boundaries of A and B, respectively, provided A and B are closed subsets of a normed linear space such that d(A,B)>0 (see [1]).

2 BPPT for weakly contractive and weakly Kannan mappings

Let A and B be nonempty subsets of a metric space (X,d). An operator T:A→B is said to be contractive if there exists k∈[0,1) such that d(Tx,Ty)≤kd(x,y) for any x,y∈A. The well-known Banach contraction principle says: Let (X,d) be a complete metric space, and T:X→X be a contraction of X into itself. Then T has a unique fixed point in X.

In the last 50 years, the Banach contraction principle has been extensively studied and generalized in many settings. One of the generalizations is the weakly contractive mapping.

Definition 2.1 [3]

Let (X,d) be a metric space. A mapping f:X→X is said to be weakly contractive provided that

d ( f ( x ) , f ( y ) ) ≤ α ¯ (x,y)d(x,y)

for all x,y∈X, where the function α ¯ :X×X→[0,1), holds, for every 0<a<b, that

θ(a,b)=sup { α ¯ ( x , y ) : a ≤ d ( x , y ) ≤ b } <1.

The fixed point theorem for weakly contractive mapping was presented in [3].

Theorem 2.2 Let (X,d) be a complete metric space. If f:X→X is a weakly contractive mapping, then f has a unique fixed point x ∗ and the Picard sequence of iterates { f n ( x ) } n ∈ N converges, for every x∈X, to x ∗ .

One type of contraction which is different from the Banach contraction is Kannan mappings. In [11], Kannan obtained the following fixed point theorem.

Theorem 2.3 [11]

Let (X,d) be a complete metric space and let f:X→X be a mapping such that

d ( f ( x ) , f ( y ) ) ≤ α 2 [ d ( x , f ( x ) ) + d ( y , f ( y ) ) ]

for all x,y∈X and some α∈[0,1), then f has a unique fixed point x ∗ ∈X. Moreover, the Picard sequence of iterates { f n ( x ) } n ∈ N converges, for every x∈X, to x ∗ .

In [12], the authors introduce a more general weakly Kannan mapping and obtain its fixed point theorem.

Definition 2.4 [12]

Let (X,d) be a metric space. A mapping f:X→X is said to be weakly Kannan if there exists α ¯ :X×X→[0,1), which satisfies for every 0<a≤b and for all x,y∈X

θ(a,b)=sup { α ¯ ( x , y ) : a ≤ d ( x , y ) ≤ b } <1

and

d ( f ( x ) , f ( y ) ) ≤ α ¯ ( x , y ) 2 [ d ( x , f ( x ) ) + d ( y , f ( y ) ) ] .

Theorem 2.5 [12]

Let (X,d) be a complete metric space. If f:X→X is a weakly Kannan mapping, then f has a unique fixed point x ∗ and the Picard sequence of iterates { f n ( x ) } n ∈ N converges, for every x∈X, to x ∗ .

In this section, we first obtain best proximity point theorems for weakly contractive mapping and weakly Kannan mapping in metric spaces. Further, we extend the results to partial metric spaces. The P-operator technique, which changes non-self-mapping to self-mapping, provides a new and simple proof. Many recent results in this area have been improved.

Before giving the main results, we need the following notations and basic facts.

Definition 2.6 [13]

Let (A,B) be a pair of nonempty subsets of a metric space (X,d) with A 0 ≠∅. Then the pair (A,B) is said to have the P-property if and only if for any x 1 , x 2 ∈ A 0 and y 1 , y 2 ∈ B 0 ,

{ d ( x 1 , y 1 ) = d ( A , B ) , d ( x 2 , y 2 ) = d ( A , B ) ⇒d( x 1 , x 2 )=d( y 1 , y 2 ).

In [13], the author proves that any pair (A,B) of nonempty closed convex subsets of a real Hilbert space H satisfies the P-property.

In [4], the P-property has been weakened to the weak P-property. An example that satisfies the P-property but not the weak P-property can be found there.

Definition 2.7 [4]

Let (A,B) be a pair of nonempty subsets of a metric space (X,d) with A 0 ≠∅. Then the pair (A,B) is said to have the weak P-property if and only if for any x 1 , x 2 ∈ A 0 and y 1 , y 2 ∈ B 0 ,

{ d ( x 1 , y 1 ) = d ( A , B ) , d ( x 2 , y 2 ) = d ( A , B ) ⇒d( x 1 , x 2 )≤d( y 1 , y 2 ).

Example [4]

Consider ( R 2 ,d), where d is the Euclidean distance and the subsets A={(0,0)} and B={y=1+ 1 − x 2 }.

Obviously, A 0 ={(0,0)}, B 0 ={(−1,1),(1,1)} and d(A,B)= 2 . Furthermore,

d ( ( 0 , 0 ) , ( − 1 , 1 ) ) =d ( ( 0 , 0 ) , ( 1 , 1 ) ) = 2 ,

however,

0=d ( ( 0 , 0 ) , ( 0 , 0 ) ) <d ( ( − 1 , 1 ) , ( 1 , 1 ) ) =2.

We can see that the pair (A,B) satisfies the weak P-property but not the P-property.

Firstly, we present the following definitions.

Definition 2.8 Let (A,B) be a pair of nonempty closed subsets of a complete metric space (X,d). A mapping f:A→B is said to be weakly contractive provided that

d ( f ( x ) , f ( y ) ) ≤ α ¯ (x,y)d(x,y)

for all x,y∈A, where the function α ¯ :X×X→[0,1) holds, for every 0<a<b, and

θ(a,b)=sup { α ¯ ( x , y ) : a ≤ d ( x , y ) ≤ b } <1.

Definition 2.9 Let (A,B) be a pair of nonempty closed subsets of a complete metric space. A mapping f:A→B is said to be weakly Kannan if there exists α ¯ :X×X→[0,1) which satisfies for every 0<a≤b and for all x,y∈X

θ(a,b)=sup { α ¯ ( x , y ) : a ≤ d ( x , y ) ≤ b } <1

and

d ( f ( x ) , f ( y ) ) ≤ α ¯ ( x , y ) 2 [ d ( x , f ( x ) ) + d ( y , f ( y ) ) − 2 d ( A , B ) ] .

Next we prove the best proximity point theorems for weakly contractive and weakly Kannan mappings in metric spaces.

Theorem 2.10 Let (A,B) be a pair of nonempty closed subsets of a complete metric space (X,d) such that A 0 ≠∅. Let T:A→B be a weakly contractive mapping defined as Definition  2.8. Suppose that T( A 0 )⊆ B 0 and the pair (A,B) has the weak P-property. Then T has a unique best proximity point x ∗ ∈ A 0 and the iteration sequence { x 2 k } n = 0 ∞ defined by

x 2 k + 1 =T x 2 k ,d( x 2 k + 2 , x 2 k + 1 )=d(A,B),k=0,1,2,…

converges, for every x 0 ∈ A 0 , to x ∗ .

Proof We first prove that B 0 is closed. Let { y n }⊆ B 0 be a sequence such that y n →q∈B. It follows from the weak P-property that

d( y n , y m )→0⇒d( x n , x m )→0,

as n,m→∞, where x n , x m ∈ A 0 and d( x n , y n )=d(A,B), d( x m , y m )=d(A,B). Then { x n } is a Cauchy sequence so that { x n } converges strongly to a point p∈A. By the continuity of metric d we have d(p,q)=d(A,B), that is, q∈ B 0 and hence B 0 is closed.

Let A ¯ 0 be the closure of A 0 ; we claim that T( A ¯ 0 )⊆ B 0 . In fact, if x∈ A ¯ 0 ∖ A 0 , then there exists a sequence { x n }⊆ A 0 such that x n →x. By the continuity of T and the closedness of B 0 we have Tx= lim n → ∞ T x n ∈ B 0 . That is T( A ¯ 0 )⊆ B 0 .

Define an operator P A 0 :T( A ¯ 0 )→ A 0 , by P A 0 y={x∈ A 0 :d(x,y)=d(A,B)}. Since the pair (A,B) has the weak P-property, we have

d( P A 0 T x 1 , P A 0 T x 2 )≤d(T x 1 ,T x 2 )≤ α ¯ ( x 1 , x 2 )d( x 1 , x 2 )

for any x 1 , x 2 ∈ A ¯ 0 . This shows that P A 0 T: A ¯ 0 → A ¯ 0 is a weak contraction from complete metric subspace A ¯ 0 into itself. Using Theorem 2.2, we can see that P A 0 T has a unique fixed point x ∗ . That is, P A 0 T x ∗ = x ∗ ∈ A 0 , which implies that

d ( x ∗ , T x ∗ ) =d(A,B).

Therefore, x ∗ is the unique one in A 0 such that d( x ∗ ,T x ∗ )=d(A,B). It is easy to see that x ∗ is also the unique one in A such that d( x ∗ ,T x ∗ )=d(A,B). The Picard iteration sequence

x n + 1 = P A 0 T x n ,n=0,1,2,…

converges, for every x 0 ∈ A 0 , to x ∗ . The iteration sequence { x 2 k } n = 0 ∞ defined by

x 2 k + 1 =T x 2 k ,d( x 2 k + 2 , x 2 k + 1 )=d(A,B),k=0,1,2,…,

is exactly the subsequence of { x n }, so that it converges, for every x 0 ∈ A 0 , to x ∗ . This completes the proof. □

Theorem 2.11 Let (A,B) be a pair of nonempty closed subsets of a complete metric space (X,d) such that A 0 ≠∅. Let T:A→B be a continuous weakly Kannan mapping defined as Definition  2.9. Suppose that T( A 0 )⊆ B 0 and the pair (A,B) has the weak P-property. Then T has a unique best proximity point x ∗ ∈ A 0 and the iteration sequence { x 2 k } n = 0 ∞ defined by

x 2 k + 1 =T x 2 k ,d( x 2 k + 2 , x 2 k + 1 )=d(A,B),k=0,1,2,…

converges, for every x 0 ∈ A 0 , to x ∗ .

Proof The closedness of B 0 and T( A ¯ 0 )⊆ B 0 have been proved in Theorem 2.10. Now we define an operator P A 0 :T( A ¯ 0 )→ A 0 , by P A 0 y={x∈ A 0 :d(x,y)=d(A,B)}. Since the pair (A,B) has weak P-property, we have

d ( P A 0 T x 1 , P A 0 T x 2 ) ≤ d ( T x 1 , T x 2 ) ≤ α ¯ ( x , y ) 2 [ d ( x 1 , T x 1 ) + d ( x 2 , T x 2 ) − 2 d ( A , B ) ] ≤ α ¯ ( x , y ) 2 [ d ( x 1 , P A 0 T x 1 ) + d ( P A 0 T x 1 , T x 1 ) + d ( x 2 , P A 0 T x 2 ) + d ( P A 0 T x 2 , T x 2 ) − 2 d ( A , B ) ] = α ¯ ( x , y ) 2 [ d ( x 1 , P A 0 T x 1 ) + d ( x 2 , P A 0 T x 2 ) ]

for any x 1 , x 2 ∈ A ¯ 0 . This shows that P A 0 T: A ¯ 0 → A ¯ 0 is a weakly Kannan mapping from complete metric subspace A ¯ 0 into itself. Using Theorem 2.5, we can see that P A 0 T a unique fixed point x ∗ . That is, P A 0 T x ∗ = x ∗ ∈ A 0 , which implies that

d ( x ∗ , T x ∗ ) =d(A,B).

Therefore, x ∗ is the unique one in A 0 such that d( x ∗ ,T x ∗ )=d(A,B). It is easy to see that x ∗ is also the unique one in A such that d( x ∗ ,T x ∗ )=d(A,B). The Picard iteration sequence

x n + 1 = P A 0 T x n ,n=0,1,2,…

converges, for every x 0 ∈ A 0 , to x ∗ . Since the iteration sequence { x 2 k } n = 0 ∞ defined by

x 2 k + 1 =T x 2 k ,d( x 2 k + 2 , x 2 k + 1 )=d(A,B),k=0,1,2,…,

is exactly the subsequence of { x n }, it converges, for every x 0 ∈ A 0 , to x ∗ . This completes the proof. □

Example 2.12 Let X= R 2 , A={(1,y):y≥0}, B={(0,y):y≥0}, and define f:A→B as follows:

f(1,y)= ( 0 , y 2 y + 1 ) .

We have A 0 =A≠∅, B 0 =B, f( A 0 )⊆ B 0 . It is obvious that (A,B) satisfy the P-property so it must satisfy the weakly P-property. Meanwhile

d ( f ( 1 , y 1 ) , f ( 1 , y 2 ) ) = | y 1 2 y 1 + 1 − y 2 2 y 2 + 1 | = | y 1 2 ( y 2 + 1 ) − y 2 2 ( y 1 + 1 ) | ( y 1 + 1 ) ( y 2 + 1 ) = | ( y 1 y 2 + y 1 + y 2 ) ( y 2 − y 1 ) | ( y 1 + 1 ) ( y 2 + 1 ) = y 1 y 2 + y 1 + y 2 ( y 1 + 1 ) ( y 2 + 1 ) | y 1 − y 2 | = y 1 y 2 + y 1 + y 2 y 1 y 2 + y 1 + y 2 + 1 | y 1 − y 2 | = y 1 y 2 + y 1 + y 2 y 1 y 2 + y 1 + y 2 + 1 d ( ( 1 , y 1 ) , ( 1 , y 2 ) ) = α ¯ ( ( 1 , y 1 ) , ( 1 , y 2 ) ) d ( ( 1 , y 1 ) , ( 1 , y 2 ) ) ,

where

α ¯ ( ( 1 , y 1 ) , ( 1 , y 2 ) ) = y 1 y 2 + y 1 + y 2 y 1 y 2 + y 1 + y 2 + 1 .

That is, f is a weakly contractive mapping. All conditions of Theorem 2.10 hold, the conclusion of Theorem 2.10 is also correct, that is, f has a unique best proximity point z ∗ =(1,0)∈ A 0 such that d( z ∗ ,f( z ∗ ))=d((1,0),(0,0))=1=d(A,B). On the other hand, it is obvious that the iteration sequence { z 2 k } n = 0 ∞ defined by

z 2 k + 1 =f( z 2 k ),d( z 2 k + 2 , z 2 k + 1 )=d(A,B)=1,k=0,1,2,…,

converges, for every z 0 ∈ A 0 , to z ∗ , since

z 2 ( k + 1 ) =(1, y 2 ( k + 1 ) )= ( 1 , y 2 k 2 y 2 k + 1 ) →(1,0).

In fact, from y 2 ( k + 1 ) = y 2 k 2 y 2 k + 1 we know that y 2 ( k + 1 ) ≤ y 2 k , so there exists a number y ∗ such that y 2 k → y ∗ . Furthermore, y ∗ = ( y ∗ ) 2 y ∗ + 1 and hence y ∗ =0.

Example 2.13 Let X= R 2 , A={(1,y),y≥0}, B={(0,y),y≥0}. For y≥0, z≥0, we have the following equivalence relations:

3 z = ( y − z ) 2 + 1 − 1 ⇔ 3 z + 1 = ( y − z ) 2 + 1 ⇔ ( 3 z + 1 ) 2 = ( y − z ) 2 + 1 = y 2 − 2 y z + z 2 + 1 ⇔ 9 z 2 + 6 z + 1 = y 2 − 2 y z + z 2 + 1 ⇔ 8 z 2 + ( 6 + 2 y ) z − y 2 = 0 ⇔ z = ( 6 + 2 y ) 2 + 32 y 2 − ( 6 + 2 y ) 16 .

We define a function f:[0,+∞)→[0,+∞) as follows:

z=f(y)= ( 6 + 2 y ) 2 + 32 y 2 − ( 6 + 2 y ) 16 .

From the above equivalence relations, we get

3f(y)= ( y − f ( y ) ) 2 + 1 −1.

Therefore, we define a mapping T:A→B as follows:

T:(1,y)↦ ( 0 , f ( y ) ) = ( 0 , ( 6 + 2 y ) 2 + 32 y 2 − ( 6 + 2 y ) 16 ) .

We have A 0 =A≠∅, B 0 =B, T( A 0 )⊆ B 0 . It is obvious that (A,B) satisfy the P-property and so must satisfy the weakly P-property. Meanwhile the following inequality holds:

d ( T ( 1 , y ) − T ( 1 , h ) ) = | f ( y ) − f ( h ) | = 1 3 | 3 f ( y ) − 3 f ( h ) | = 1 3 | ( ( y − f ( y ) ) 2 + 1 − 1 ) − ( ( h − f ( h ) ) 2 + 1 − 1 ) | = 1 3 | ( y − f ( y ) ) 2 + 1 + ( h − f ( h ) ) 2 + 1 − 2 ( h − f ( h ) ) 2 + 1 | ≤ 1 3 | ( y − f ( y ) ) 2 + 1 + ( h − f ( h ) ) 2 + 1 − 2 | = 1 3 | d ( ( 1 , y ) , T ( 1 , y ) ) + d ( ( 1 , h ) , T ( 1 , h ) ) − 2 d ( A , B ) | ≤ y + h + 2 2 ( y + h + 3 ) | d ( ( 1 , y ) , T ( 1 , y ) ) + d ( ( 1 , h ) , T ( 1 , h ) ) − 2 d ( A , B ) | = α ¯ ( y , h ) 2 | d ( ( 1 , y ) , T ( 1 , y ) ) + d ( ( 1 , h ) , T ( 1 , h ) ) − 2 d ( A , B ) | ,

where α ¯ (y,h)= y + h + 2 ( y + h + 3 ) . That is, T is a continuous weakly Kannan mapping. All conditions of Theorem 2.11 hold, the conclusion of Theorem 2.11 is also correct, that is, T has a unique best proximity point z ∗ =(1,0)∈ A 0 such that d( z ∗ ,T( z ∗ ))=d((1,0),(0,0))=1=d(A,B). On the other hand, it is obvious that the iteration sequence { z 2 k } n = 0 ∞ defined by

z 2 k + 1 =T( z 2 k ),d( z 2 k + 2 , z 2 k + 1 )=d(A,B)=1,k=0,1,2,…,

converges, for every z 0 ∈ A 0 , to z ∗ , since z 2 ( k + 1 ) =(1, 1 3 ( y 2 k − f ( y 2 k ) ) 2 + 1 −1)→(1,0).

3 Generalized BPPT for generalized contractions

Definition 3.1 [3]

A mapping T:A→B is said to be a proximal contraction of the first kind if there exists a non-negative number α<1 such that

{ d ( u 1 , T x 1 ) = d ( A , B ) , d ( u 2 , T x 2 ) = d ( A , B ) ⇒d( u 1 , u 2 )≤αd( x 1 , x 2 )

for all u 1 , u 2 , x 1 , x 2 ∈A.

Recently in [9], Amini-Harandi et al. introduced the following new class of proximal contractions and proved the following result.

Definition 3.2 [9]

A mapping T:A→B is said to be a (φ,g)-contraction if

{ d ( u 1 , T x 1 ) = d ( A , B ) , d ( u 2 , T x 2 ) = d ( A , B ) ⇒d( u 1 , u 2 )≤φ ( d ( g ( x 1 ) , g ( x 2 ) ) )

for all u 1 , u 2 , x 1 , x 2 ∈A, where φ:[0,∞)→[0,∞) is a function obeying the following conditions:

φ(0)=0,φ(t)<t, lim sup s → t + φ(s)<t,∀t>0,

and g:A→A is a mapping. If g is the identity operator, T:A→B is said to be a φ-contraction.

Definition 3.3 An element x in A is said to be a best proximity point of the mapping T:A→B if it satisfies the condition that d(x,Tx)=d(A,B).

Theorem 3.4 [9]

Let A and B be nonempty closed subsets of a complete metric space (X,d) such that B is approximately compact with respect to A. Moreover, assume that A 0 and B 0 are nonempty. Let T:A→B and g:A→A satisfy the following conditions.

  1. (a)

    T is a (φ,g)-proximal contraction,

  2. (b)

    T( A 0 )⊆ B 0 ,

  3. (c)

    g is a one-to-one continuous map such that g − 1 :g(A)→A is uniformly continuous,

  4. (d)

    A 0 ⊆g( A 0 ).

Then there exists a unique element x∈A such that d(g(x),Tx)=d(A,B). Further, for any fixed element x∈ A 0 , the sequence { x n } defined by d(g( x n + ),T x n )=d(A,B) converges to x.

The purpose of this section is to improve the result of Amini-Harandi et al. by using a new simple method of proof without the hypothesis of approximate compactness to B.

The following lemma is important for our results, which is actually a generalized Banach’s fixed point theorem.

Lemma 3.5 Let A be a subset of a complete metric space (X,d), and let T:X→X a continuous mapping with conditions

d(Tx,Ty)≤φ ( d ( x , y ) ) ,∀x,y∈A,

and T(A)⊆A, where φ:[0,∞)→[0,∞) is a function obeying the following conditions:

φ(0)=0,φ(t)<t, lim sup s → t + φ(s)<t,∀t>0.

Then for any fixed element x 0 ∈X, the sequence { x n } defined by x n + 1 =T x n converges to a point x∈ A ¯ . Further, x is a fixed point of T.

Proof We claim that { x n } is a Cauchy sequence. Suppose, to the contrary, that { x n } is not a Cauchy sequence. Then there exist ε 0 >0 and two subsequences of integers { n k }, { m k } such that

d( x n k , x m k )≥ ε 0 ,k=1,2,3,….
(3.1)

Since d( x n , x n + 1 )→0 (n→∞) is obvious, we may also assume

d( x n k , x m k − 1 )< ε 0
(3.2)

by choosing m k to be the smallest number exceeding n k for which (3.1) holds. From (3.1) and (3.2) we have

ε 0 ≤d( x n k , x m k )≤d( x n k , x m k − 1 )+d( x m k − 1 , x m k )< ε 0 +d( x m k − 1 , x m k ).

Taking the limit as k→∞, we get

lim k → ∞ d( x n k , x m k )= ε 0 .

By the triangle inequality

d ( x n k , x m k ) ≤ d ( x n k , x n k + 1 ) + d ( x n k + 1 , x m k + 1 ) + d ( x m k + 1 , x m k ) ≤ d ( x n k , x n k + 1 ) + φ ( d ( x n k , x m k ) ) + d ( x m k + 1 , x m k ) .

Taking the sup-limit as k→∞, we get

ε 0 ≤ lim sup k → ∞ φ ( d ( x n k , x m k ) ) < ε 0 ,

a contradiction. Therefore { x n } is a Cauchy sequence. Since X is complete, there exists x∈X such that x n →x. It is obvious from the continuity of T and d( x n ,T x n )→0 that x is a fixed point of T. This completes the proof. □

Now, we are ready to state our main result in this section.

Theorem 3.6 Let A and B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Let T:A→B and g:A→A satisfy the following conditions.

  1. (a)

    g is a one-to-one continuous map such that g − 1 :g(A)→A is uniformly continuous;

  2. (b)

    T is a (φ,g)-contraction with T( A 0 )⊂ B 0 .

Then there exists a unique element x ∗ ∈A such that d(g( x ∗ ),T x ∗ )=d(A,B). Further, for any fixed element x 0 ∈ A 0 , the sequence defined by d(g( x n + 1 ),T x n )=d(A,B), converges to x ∗ .

Proof Let

D(x,y)=d ( g ( x ) , g ( y ) ) ,∀x,y∈A.

It is obvious that D(x,y) is a metric on the A. Now we prove (A,D) is a complete metric space. Let { x n }⊆(A,D) be a Cauchy sequence, we have

lim n , m → ∞ D( x n , x m )= lim n , m → ∞ d ( g ( x n ) , g ( x m ) ) =0.

Since g − 1 :g(A)→A is uniformly continuous, we have

lim n , m → ∞ d( x n , x m )= lim n , m → ∞ d ( g − 1 g ( x n ) , g − 1 g ( x m ) ) =0

and hence { x n }⊆(A,d) is a Cauchy sequence. Since (A,d) is a complete metric space, there exists an element x∈A such that d( x n ,x)→0 as n→∞. Since g is continuous, we have D( x n ,x)→0 as n→∞. This completes the proof of the completeness of (A,D).

For any x∈ A 0 , from (b) we know Tx∈ B 0 . Since T is a (φ,g)-contraction, there exists a unique z∈ A 0 such that d(z,Tx)=d(A,B). We denote z= T 0 Tx. Then T 0 :S( A 0 )→ A 0 is a mapping. Further, we define a composite mapping u= T 0 Tx from A 0 into itself. Since T is a (φ,g)-contraction, we have

d( T 0 T x 1 , T 0 T x 2 )≤φ ( d ( g ( x 1 ) , g ( x 2 ) ) )

for any x 1 , x 2 ∈ A 0 ,

d ( g g − 1 ( T 0 T x 1 ) , g g − 1 ( T 0 T x 2 ) ) ≤φ ( d ( g ( x 1 ) , g ( x 2 ) ) )

for any x 1 , x 2 ∈ A 0 , and

D ( g − 1 T 0 T x 1 , g − 1 T 0 T x 2 ) ≤φ ( D ( x 1 , x 2 ) )

for any x 1 , x 2 ∈ A 0 . From the above inequality, we also know that the mapping u= g − 1 T 0 Tx is continuous on the A 0 , so we can expand the definition of u= g − 1 T 0 Tx onto A ¯ 0 such that it is still continuous on the A ¯ 0 . By using Lemma 3.5, we know for any fixed element x 0 ∈ A 0 , that the sequence { x n } defined by

x n + 1 = g − 1 T 0 T x n ,

which is equivalent to d(g( x n + 1 ),T x n )=d(A,B), converges to a point x ∗ ∈ A ¯ . Further, x ∗ is a fixed point of g − 1 T 0 T. That is, x ∗ = g − 1 T 0 T x ∗ which is equivalent to d(g( x ∗ ),T x ∗ )=d(A,B). Since T is a (φ,g)-contraction, this x ∗ is unique. This completes the proof. □

Corollary 3.7 Let A and B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Let T:A→B and g:A→A satisfy the following conditions.

  1. (a)

    g is a one-to-one continuous map such that g − 1 :g(A)→A is uniformly continuous;

  2. (b)

    T is a proximal contraction of the first kind with T( A 0 )⊂ B 0 .

Then there exists a unique element x ∗ ∈A such that d(g( x ∗ ),T x ∗ )=d(A,B). Further, for any fixed element x 0 ∈ A 0 , the sequence defined by d(g( x n + 1 ),T x n )=d(A,B) converges to x ∗ .

Corollary 3.8 Let A and B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Let T:A→B be is a φ-contraction with T( A 0 )⊂ B 0 . Then there exists a unique best proximity point x ∗ ∈A of T. Further, for any fixed element x 0 ∈ A 0 , the sequence defined by d( x n + 1 ,T x n )=d(A,B) converges to x ∗ .

Remark 3.9 In Theorem 3.6, we do not need the hypothesis of approximate compactness to B. Therefore, Theorem 3.6 improved substantially the results of Theorem 3.4. On the other hand, the method of proof is also different.

4 BPPT for proximal cyclic contraction mappings

Definition 4.1 [1]

Given non-self-mappings S:A→B and T:B→A, the pair (S,T) is said to form a proximal cyclic contraction if there exists a non-negative number α<1 such that

{ d ( u , S x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) ⇒d(u,v)≤αd(x,y)+(1−α)d(A,B)

for all u,x∈A and v,y∈B.

Definition 4.2 [1]

A mapping S:A→B is said to be a proximal contraction of the first kind if there exists a non-negative number α<1 such that

{ d ( u 1 , S x 1 ) = d ( A , B ) , d ( u 2 , S x 2 ) = d ( A , B ) ⇒d( u 1 , u 2 )≤αd( x 1 , x 2 )

for all u 1 , u 2 , x 1 , x 2 ∈A.

Definition 4.3 An element x in A is said to be a best proximity point of the mapping S:A→B if it satisfies the condition that d(x,Sx)=d(A,B).

In [1], the author proved the following result, a generalized best proximity point theorem for non-self-proximal contractions of the first kind.

Theorem 4.4 [1]

Let A and B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Let S:A→B, T:B→A and g:A∪B→A∪B satisfy the following conditions.

  1. (a)

    S and T are proximal contractions of the first kind.

  2. (b)

    S( A 0 )⊂ B 0 and T( B 0 )⊂ A 0 .

  3. (c)

    The pair (S,T) forms a proximal cyclic contraction.

  4. (d)

    g is an isometry.

  5. (e)

    A 0 ⊂g( A 0 ) and B 0 ⊂g( B 0 ).

Then there exist a unique element x in A and a unique element y in B satisfying the conditions that

d(x,y)=d(gx,Sx)=d(gy,Ty)=d(A,B).

Further, for any fixed element x 0 in A 0 , the sequence { x n }, defined by

d(g x n + 1 ,S x n )=d(A,B),

converges to the element x. For any fixed element y 0 in B 0 , the sequence { y n }, defined by

d(g y n + 1 ,T y n )=d(A,B),

converges to the element y.

On the other hand, a sequence { u n } of elements in A converges to x if there is a sequence { ε n } of positive numbers for which lim n → ∞ ε n =0, d( u n + 1 , z n + 1 )≤ ε n , where z n + 1 ∈A satisfies the condition that d( z n + 1 ,S u n )=d(A,B).

In 1973, Geraghty introduced the Geraghty-contraction and obtained Theorem 4.6.

Definition 4.5 [14]

Let (X,d) be a metric space. A mapping T:X→X is said to be a Geraghty-contraction if there exists β∈Γ such that for any x,y∈X

d(Tx,Ty)≤β ( d ( x , y ) ) ⋅d(x,y),

where the class Γ denotes those functions β:[0,∞)→[0,1) satisfying the following condition:

β( t n )→1⇒ t n →0.

Theorem 4.6 [14]

Let (X,d) be a complete metric space and T:X→X be a Geraghty-contraction. Then T has a unique fixed point x ∗ and, for any x 0 ∈X, the iterative sequence x n + 1 =T x n converges to x ∗ .

Definition 4.7 [2]

A mapping S:A→B is called Geraghty’s proximal contraction of the first kind if there exists β∈Γ such that

{ d ( u 1 , S x 1 ) = d ( A , B ) , d ( u 2 , S x 2 ) = d ( A , B ) ⇒d( u 1 , u 2 )≤β ( d ( x 1 , x 2 ) ) d( x 1 , x 2 )

for all u 1 , u 2 , x 1 , x 2 ∈A.

In [2], the authors proved the following result.

Theorem 4.8 [2]

Let A and B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Let S:A→B, T:B→A, and g:A∪B→A∪B satisfy the following conditions.

  1. (a)

    S, T are Geraghty’s proximal contractions of the first kind.

  2. (b)

    S( A 0 )⊂ B 0 and T( B 0 )⊂ A 0 .

  3. (c)

    The pair (S,T) forms a proximal cyclic contraction.

  4. (d)

    g is an isometry.

  5. (e)

    A 0 ⊂g( A 0 ) and B 0 ⊂g( B 0 ).

Then there exist a unique element x ∗ in A and a unique element y ∗ in B satisfying the conditions that

d ( x ∗ , y ∗ ) =d ( g x ∗ , S x ∗ ) =d ( g y ∗ , T y ∗ ) =d(A,B).

Further, for any fixed element x 0 in A 0 , the sequence { x n }, defined by

d(g x n + 1 ,S x n )=d(A,B),

converges to the element x ∗ . For any fixed element y 0 in B 0 , the sequence { y n }, defined by

d(g y n + 1 ,T y n )=d(A,B),

converges to the element y ∗ .

On the other hand, a sequence { u n } of elements in A converges to x if there is a sequence { ε n } of positive numbers for which lim n → ∞ ε n =0, d( u n + 1 , z n + 1 )≤ ε n , where z n + 1 ∈A satisfies the condition that d( z n + 1 ,S u n )=d(A,B).

The purpose of this section is to prove best proximity point theorems for proximal cyclic contractions and weakly proximal contractions by using the new method of proof. Our results improve and extend the recent results of some others. Meanwhile, we point out a mistake in Theorem 4.8.

Theorem 4.9 Let A and B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Let S:A→B, T:B→A, and g:A∪B→A∪B satisfy the following conditions.

  1. (a)

    S, T are Geraghty’s proximal contractions of the first kind.

  2. (b)

    S( A 0 )⊂ B 0 and T( B 0 )⊂ A 0 .

  3. (c)

    The pair (S,T) forms a proximal cyclic contraction.

  4. (d)

    g is an isometry.

  5. (e)

    A 0 ⊂g( A 0 ) and B 0 ⊂g( B 0 ).

Then there exist a unique element x ∗ in A and a unique element y ∗ in B satisfying the conditions that

d ( x ∗ , y ∗ ) =d ( g x ∗ , S x ∗ ) =d ( g y ∗ , T y ∗ ) =d(A,B).

Further, for any fixed element x 0 in A 0 , the sequence { x n }, defined by

d(g x n + 1 ,S x n )=d(A,B),

converges to the element x ∗ . For any fixed element y 0 in B 0 , the sequence { y n }, defined by

d(g y n + 1 ,T y n )=d(A,B),

converges to the element y ∗ .

On the other hand, assume β(t)≤α<1. Then a sequence { u n } of elements in A converges to x ∗ if there is a sequence { ε n } of positive numbers for which lim n → ∞ ε n =0, d( u n + 1 , z n + 1 )≤ ε n , where z n + 1 ∈A satisfies the condition that d(g z n + 1 ,S u n )=d(A,B).

Proof For any x∈ A 0 , from (b) we know Sx∈ B 0 . Since S is a Geraghty-contraction, there exists a unique z∈ A 0 such that d(z,Sx)=d(A,B). We denote z= S 0 Sx. Then S 0 :S( A 0 )→ A 0 is a mapping. Further, we define a composite mapping u= g − 1 S 0 Sx from A 0 into itself. Since S is a Geraghty-contraction, we have

d ( g − 1 S 0 S x 1 , g − 1 S 0 S x 2 ) =d( S 0 S x 1 , S 0 S x 2 )≤β ( d ( x 1 , x 2 ) ) ( d ( x 1 , x 2 ) )
(4.1)

for any x 1 , x 2 ∈ A 0 . From the above inequality, we also know that the mapping u= g − 1 S 0 Sx is continuous, so we can expand the definition of u= g − 1 S 0 Sx onto A ¯ 0 . Because we do not need the continuity of function β(t), we define another function β ¯ (t):[0,∞)→[0,1) as follows:

β ¯ (t)={ β ( 0 ) , t = 0 , max { lim sup r n → t β ( r n ) , β ( t ) } , t > 0 .

It is easy to see β ¯ (t)∈Γ. From (4.1) we get

d ( g − 1 S 0 S x 1 , g − 1 S 0 S x 2 ) =d( S 0 S x 1 , S 0 S x 2 )≤ β ¯ ( d ( x 1 , x 2 ) ) ( d ( x 1 , x 2 ) )
(4.2)

for any x 1 , x 2 ∈ A ¯ 0 . From (4.2) we know g − 1 S 0 S: A ¯ 0 → A ¯ 0 is a Geraghty-contraction. By using Theorem 4.6, we claim g − 1 S 0 S has a unique fixed point x ∗ in A ¯ 0 , that is, x ∗ = g − 1 S 0 S x ∗ , which implies g x ∗ = S 0 S x ∗ and hence d(g x ∗ ,S x ∗ )=d(A,B). By using the same method, we can prove that there exists a unique element y ∗ in B ¯ 0 such that d(g y ∗ ,T y ∗ )=d(A,B). On the other hand, from (c) we have

d ( x ∗ , y ∗ ) =d ( g x ∗ , g y ∗ ) ≤αd ( x ∗ , y ∗ ) +(1−α)d(A,B),

which implies d( x ∗ , y ∗ )≤d(A,B) and hence d( x ∗ , y ∗ )=d(A,B).

Since g − 1 S 0 S is a Geraghty-contraction, for any fixed element x 0 in A 0 , the sequence { x n }, defined by x n + 1 = g − 1 S 0 S x n converges to the element x ∗ . This sequence { x n } also is defined by d(g x n + 1 ,S x n )=d(A,B). For the same reason, for any fixed element y 0 in B 0 , the sequence { y n }, defined by y n + 1 = g − 1 T 0 T x n , converges to the element y ∗ . This sequence { y n } also is defined by d(g y n + 1 ,T y n )=d(A,B).

Finally, d(g z n + 1 ,S u n )=d(A,B)⇔ z n + 1 = g − 1 S 0 S u n , which gives us

d ( x n + 1 , u n + 1 ) ≤ d ( x n + 1 , z n + 1 ) + d ( z n + 1 , u n + 1 ) ≤ d ( g − 1 S 0 S x n , g − 1 S 0 S u n ) + d ( z n + 1 , u n + 1 ) ≤ β ( d ( x n , u n ) ) d ( x n , u n ) + d ( z n + 1 , u n + 1 ) ≤ α d ( x n , u n ) + d ( z n + 1 , u n + 1 ) .

It is easy to prove d( x n + 1 , u n + 1 )→0 which implies u n → x ∗ . This completes the proof. □

Remark 4.10 If β(t)≡α<1, then Theorem 4.9 yields Theorem 4.4.

Remark 4.11 In the reference [2], from line 15 to line 20 on page 7, the following argument is wrong, so the final conclusion of Theorem 1.8 is not correct.

The wrong argument For any ε>0, choose a positive integer N such that ε n ≤ε for all n>N. Observe that

d ( x n + 1 , u n + 1 ) ≤ d ( x n + 1 , z n + 1 ) + d ( z n + 1 , u n + 1 ) ≤ β ( d ( x n , u n ) ) d ( x n , u n ) + ε n ≤ d ( x n , u n ) + ε .

Since ε is arbitrary, we can conclude that for all n≥N the sequence {d( x n , u n )} is nonincreasing and bounded below and hence converges to some non-negative real number r.

Counter-example Let

d n = ∑ k = 1 n 1 k ,n=1,2,3,…,

then

d n + 1 ≤ d n + 1 n + 1 ,

and, for any ε>0, we can choose a positive integer N such that 1 n + 1 ≤ε for all n>N, and hence

d n + 1 ≤ d n +ε.

But d n is not nonincreasing and d n →∞ as n→∞.

Next we prove the best proximal point theorem for a weakly proximal contractive mapping.

Definition 4.12 Let A and B be nonempty subsets of a complete metric space. A mapping S:A→B is called weak proximal contraction if

{ d ( u 1 , S x 1 ) = d ( A , B ) , d ( u 2 , S x 2 ) = d ( A , B ) ⇒d( u 1 , u 2 )≤ α ¯ ( x 1 , x 2 )d( x 1 , x 2 )

for all u 1 , u 2 , x 1 , x 2 ∈A, where for the function α ¯ :X×X→[0,1) we have, for every 0<a<b,

θ(a,b)=sup { α ¯ ( x , y ) : a ≤ d ( x , y ) ≤ b } <1.

Theorem 4.13 Let A and B be nonempty closed subsets of a complete metric space such that A 0 and B 0 are nonempty. Let S:A→B, T:B→A and g:A∪B→A∪B satisfy the following conditions.

  1. (a)

    S, T are weakly proximal contractions.

  2. (b)

    S( A 0 )⊂ B 0 and T( B 0 )⊂ A 0 .

  3. (c)

    The pair (S,T) forms a proximal cyclic contraction.

  4. (d)

    g is an isometry.

  5. (e)

    A 0 ⊂g( A 0 ) and B 0 ⊂g( B 0 ).

Then there exist a unique element x ∗ in A and a unique element y ∗ in B satisfying the conditions that

d ( x ∗ , y ∗ ) =d ( g x ∗ , S x ∗ ) =d ( g y ∗ , T y ∗ ) =d(A,B).

Further, for any fixed element x 0 in A 0 , the sequence { x n }, defined by

d(g x n + 1 ,S x n )=d(A,B),

converges to the element x ∗ . For any fixed element y 0 in B 0 , the sequence { y n }, defined by

d(g y n + 1 ,T y n )=d(A,B),

converges to the element y ∗ .

On the other hand, assume α ¯ (x,y)≤α<1. Then a sequence { u n } of elements in A converges to x ∗ if there is a sequence { ε n } of positive numbers for which lim n → ∞ ε n =0, d( u n + 1 , z n + 1 )≤ ε n , where z n + 1 ∈A satisfies the condition that d(g z n + 1 ,S u n )=d(A,B).

Proof For any x∈ A 0 , from (b) we know Sx∈ B 0 . Since S is a weakly contractive mapping, there exists a unique z∈ A 0 such that d(z,Sx)=d(A,B). We denote z= S 0 Sx. Then S 0 :S( A 0 )→ A 0 is a mapping. Further, we define a composite mapping u= g − 1 S 0 Sx from A 0 into itself. Since S is a weakly contractive mapping, then we have

d ( g − 1 S 0 S x 1 , g − 1 S 0 S x 2 ) =d( S 0 S x 1 , S 0 S x 2 )≤ α ¯ ( x 1 , x 2 )d( x 1 , x 2 )

for any x 1 , x 2 ∈ A 0 . From above inequality, we also know the mapping u= g − 1 S 0 Sx is continuous, so we can expand the definition of u= g − 1 S 0 Sx onto A ¯ 0 . From the above inequality we know that g − 1 S 0 S: A ¯ 0 → A ¯ 0 is a weak contractive mapping. By using Theorem 2.2, we claim that g − 1 S 0 S has a unique fixed point x ∗ in A ¯ 0 , that is, x ∗ = g − 1 S 0 S x ∗ , which implies g x ∗ = S 0 S x ∗ and hence d(g x ∗ ,S x ∗ )=d(A,B). By using the same method, we can prove that there exists a unique element y ∗ in B ¯ 0 such that d(g y ∗ ,T y ∗ )=d(A,B). On the other hand, from (c) we have

d ( x ∗ , y ∗ ) =d ( g x ∗ , g y ∗ ) ≤αd ( x ∗ , y ∗ ) +(1−α)d(A,B),

which implies d( x ∗ , y ∗ )≤d(A,B) and hence d( x ∗ , y ∗ )=d(A,B).

Since g − 1 S 0 S is a weak contractive mapping, for any fixed element x 0 in A 0 , the sequence { x n }, defined by x n + 1 = g − 1 S 0 S x n converges to the element x ∗ . This sequence { x n } also is defined by d(g x n + 1 ,S x n )=d(A,B). By the same reason, for any fixed element y 0 in B 0 , the sequence { y n }, defined by y n + 1 = g − 1 T 0 T x n converges to the element y ∗ . This sequence { y n } also is defined by d(g y n + 1 ,T y n )=d(A,B).

Finally, d(g z n + 1 ,S u n )=d(A,B)⇔ z n + 1 = g − 1 S 0 S u n , which gives us

d ( x n + 1 , u n + 1 ) ≤ d ( x n + 1 , z n + 1 ) + d ( z n + 1 , u n + 1 ) ≤ d ( g − 1 S 0 S x n , g − 1 S 0 S u n ) + d ( z n + 1 , u n + 1 ) ≤ α ¯ ( x n , u n ) d ( x n , u n ) + d ( z n + 1 , u n + 1 ) ≤ α d ( x n , u n ) + d ( z n + 1 , u n + 1 ) .

It is easy to prove d( x n + 1 , u n + 1 )→0, which implies u n → x ∗ , This completes the proof. □

References

  1. Sadiq Basha S: Best proximity point theorems generalizing the contraction principle. Nonlinear Anal. 2011, 74: 5844–5850. 10.1016/j.na.2011.04.017

    Article  MathSciNet  MATH  Google Scholar 

  2. Mongkolkeha C, Cho YJ, Kumam P: Best proximity points for Geraghty’s proximal contraction mappings. Fixed Point Theory Appl. 2013., 2013: Article ID 180

    Google Scholar 

  3. Dugundji J, Granas A: Weakly contractive mappings and elementary domain invariance theorem. Bull. Soc. Math. Grèce 1978, 19: 141–151.

    MathSciNet  MATH  Google Scholar 

  4. Zhang J, Su Y, Cheng Q: A note on ‘A best proximity point theorem for Geraghty-contractions’. Fixed Point Theory Appl. 2013., 2013: Article ID 99

    Google Scholar 

  5. Alghamdi MA, Alghamdi MA, Shahzad N: Best proximity point results in geodesic metric spaces. Fixed Point Theory Appl. 2013., 2013: Article ID 164

    Google Scholar 

  6. Nashine HK, Kumam P, Vetro C: Best proximity point theorems for rational proximal contractions. Fixed Point Theory Appl. 2013., 2013: Article ID 95

    Google Scholar 

  7. Karapinar E: On best proximity point of ψ -Geraghty contractions. Fixed Point Theory Appl. 2013., 2013: Article ID 200

    Google Scholar 

  8. Zhang J, Su Y, Cheng Q: Best proximity point theorems for generalized contractions in partially ordered metric spaces. Fixed Point Theory Appl. 2013., 2013: Article ID 83

    Google Scholar 

  9. Amini-Harandi A, Hussain N, Akbar F: Best proximity point results for generalized contractions in metric spaces. Fixed Point Theory Appl. 2013., 2013: Article ID 164

    Google Scholar 

  10. Zhang J, Su Y: Best proximity point theorems for weakly contractive mapping and weakly Kannan mapping in partial metric spaces. Fixed Point Theory Appl. 2014., 2014: Article ID 50

    Google Scholar 

  11. Kannan R: Some results on fixed points. Bull. Calcutta Math. Soc. 1968, 60: 71–76.

    MathSciNet  MATH  Google Scholar 

  12. Ariza-Ruiz D, Jimenez-Melando A: A continuation method for weakly Kannan mappings. Fixed Point Theory Appl. 2010., 2010: Article ID 321594

    Google Scholar 

  13. Kirk WA, Reich S, Veeramani P: Proximinal retracts and best proximity pair theorems. Numer. Funct. Anal. Optim. 2003, 24: 851–862. 10.1081/NFA-120026380

    Article  MathSciNet  MATH  Google Scholar 

  14. Geraghty M: On contractive mappings. Proc. Am. Math. Soc. 1973, 40: 604–608. 10.1090/S0002-9939-1973-0334176-5

    Article  MathSciNet  MATH  Google Scholar 

  15. Sintunavarat W, Kumam P: Coupled best proximity point theorem in metric spaces. Fixed Point Theory Appl. 2012., 2012: Article ID 93

    Google Scholar 

  16. Kumam P, Aydi H, Karapinar E, Sintunavarat W: Best proximity points and extension of Mizoguchi-Takahashi’s fixed point theorems. Fixed Point Theory Appl. 2013., 2013: Article ID 242

    Google Scholar 

  17. Karapinar E, Sintunavarat W: The existence of an optimal approximate solution theorems for generalized proximal contraction non-self mappings and applications. Fixed Point Theory Appl. 2013., 2013: Article ID 323

    Google Scholar 

  18. Sintunavarat W, Kumam P: The existence theorems of an optimal approximate solution for generalized proximal contraction mappings. Abstr. Appl. Anal. 2013., 2013: Article ID 375604

    Google Scholar 

Download references

Acknowledgements

This project is supported by the National Natural Science Foundation of China under grant (11071279).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yongfu Su.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, Y., Su, Y. & Zhang, J. A new method for the research of best proximity point theorems of nonlinear mappings. Fixed Point Theory Appl 2014, 116 (2014). https://doi.org/10.1186/1687-1812-2014-116

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2014-116

Keywords