Additional Information
| Author(s) | Kumam, Poom, Mongkolkeha, Chirasak |
|---|
Common best proximity points for proximity commuting mapping with Geraghty’s functions
Kumam, Poom and Mongkolkeha, Chirasak
Abstract
carpathian_2015_31_3_359_364_abstractFull PDF
carpathian_2015_31_3_359_364In 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.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration