Common Best Proximity Points: Global Optimal Solutions
N. Shahzad (),
S. Sadiq Basha () and
R. Jeyaraj ()
Additional contact information
N. Shahzad: King AbdulAziz University
S. Sadiq Basha: Anna University
R. Jeyaraj: St. Joesph’s College Higher Secondary School
Journal of Optimization Theory and Applications, 2011, vol. 148, issue 1, No 5, 69-78
Abstract:
Abstract Let S:A→B and T:A→B be given non-self mappings, where A and B are non-empty subsets of a metric space. As S and T are non-self mappings, the equations Sx=x and Tx=x do not necessarily have a common solution, called a common fixed point of the mappings S and T. Therefore, in such cases of non-existence of a common solution, it is attempted to find an element x that is closest to both Sx and Tx in some sense. Indeed, common best proximity point theorems explore the existence of such optimal solutions, known as common best proximity points, to the equations Sx=x and Tx=x when there is no common solution. It is remarked that the functions x→d(x,Sx) and x→d(x,Tx) gauge the error involved for an approximate solution of the equations Sx=x and Tx=x. In view of the fact that, for any element x in A, the distance between x and Sx, and the distance between x and Tx are at least the distance between the sets A and B, a common best proximity point theorem achieves global minimum of both functions x→d(x,Sx) and x→d(x,Tx) by stipulating a common approximate solution of the equations Sx=x and Tx=x to fulfill the condition that d(x,Sx)=d(x,Tx)=d(A,B). The purpose of this article is to elicit common best proximity point theorems for pairs of contractive non-self mappings and for pairs of contraction non-self mappings, yielding common optimal approximate solutions of certain fixed point equations. Besides establishing the existence of common best proximity points, iterative algorithms are also furnished to determine such optimal approximate solutions.
Keywords: Global optimal solution; Common fixed point; Common best proximity point; Contractive mapping; Contraction; Cyclic contractive pair (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (13)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-010-9745-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:148:y:2011:i:1:d:10.1007_s10957-010-9745-7
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-010-9745-7
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().