On best proximity pair theorems and fixed-point theorems (Q1864352): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040243673 / rank
 
Normal rank

Latest revision as of 10:18, 30 July 2024

scientific article
Language Label Description Also known as
English
On best proximity pair theorems and fixed-point theorems
scientific article

    Statements

    On best proximity pair theorems and fixed-point theorems (English)
    0 references
    0 references
    0 references
    17 March 2003
    0 references
    Summary: The significance of fixed-point theory stems from the fact that it furnishes a unified approach and constitutes an important tool in solving equations which are not necessarily linear. On the other hand, if the fixed-point equation \(Tx=x\) does not possess a solution, it is contemplated to resolve a problem of finding an element \(x\) such that \(x\) is in proximity to \(Tx\) in some sense. Best proximity pair theorems analyze the conditions under which the optimization problem, namely \(\min_{x\in A}d(x,Tx)\) has a solution. In this paper, we discuss the difference between best approximation theorems and best proximity pair theorems. We also discuss an application of a best proximity pair theorem to the theory of games.
    0 references
    multivalued map between metric spaces
    0 references
    best proximity pair
    0 references
    best approximation
    0 references
    game theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references