Best proximity points for proximal generalized contractions in metric spaces (Q2377214)

Given two nonempty subsets \(A\) and \(B\) of a metric space \((X, d)\) and a non-self mapping \(T: A \to B\), the equation \(Tx = x\) is unlikely to have an exact solution. If there is no exact solution to this equation then a best proximity point theorem offers sufficient conditions for the existence of an optimal approximate solution \(x\), called a best proximity point of the mapping \(T\), satisfying the condition \[ d(x, T x) = d(A, B) \equiv \inf\{d(x, y) : x \in A\, {\text{ and }}\, y \in B\} \] Let \(S\) denote the class of those functions \(\beta : (0,\infty) \to [0,1)\) which satisfy the condition \(\beta(t_n) \to 1 \Rightarrow t_n \to 0\), and \(\mathbf \Psi\) denotes the set of all increasing continuous functions \(\mathbf \Psi : [0,\infty) \to [0, \infty)\) such that \(t \leq \mathbf \Psi(t)\) for each \(t \geq 0\) and \(\mathbf\Psi(0) = 0\). We say that a mapping \(T: A \to B\) is a proximal generalized contraction if there exists a map \(\beta \in S\) such that, for all \(u_1, u_2, x_1, x_2\) \(A d(u_1,Tx_1) = d(A, B) = d(u_2,Tx_2) \Rightarrow\Psi(d(u_1,u_2)) \leq \beta (d(x_1, x_2))\Psi(d(x_1, x_2))\) where \(\Psi \in \mathbf\Psi\). In this paper, the author establishes the existence of a best proximity point for a non-self-proximal generalized contraction. Further, an algorithm for determining such an optimal approximate solution has been furnished. The main result (Theorem 3.1) generalizes a result of \textit{S. Sadiq Basha} [J. Optim. Theory Appl. 151, No. 1, 210--216 (2011; Zbl 1226.90135)] for proximal contraction mappings. An example is given to show that Theorem 3.1 is an extension of the corresponding result of Sadiq Basha.