Best proximity point results in complex valued metric spaces (Q1637858)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Best proximity point results in complex valued metric spaces |
scientific article; zbMATH DE number 6883069
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best proximity point results in complex valued metric spaces |
scientific article; zbMATH DE number 6883069 |
Statements
Best proximity point results in complex valued metric spaces (English)
0 references
11 June 2018
0 references
Summary: We introduce the concept of proximity points for nonself-mappings between two subsets of a complex valued metric space which is a recently introduced extension of metric spaces obtained by allowing the metric function to assume values from the field of complex numbers. We apply this concept to obtain the minimum distance between two subsets of the complex valued metric spaces. We treat the problem as that of finding the global optimal solution of a fixed point equation although the exact solution does not in general exist. We also define and use the concept of \(P\)-property in such spaces. Our results are illustrated with examples.
0 references
complex-valued metric space
0 references
best proximity point
0 references
minimum distance
0 references
\(P\)-property
0 references