Best approximation in ℝ-trees
An ℝ-tree is a geodesic space for which there is a unique arc joining any two of its points, and this arc is a metric segment. We give a constructive proof of the following "best approximation" theorem in such spaces. Suppose X is a closed convex and geodesically bounded subset of an ℝ-tre...
Saved in:
Main Authors: | W. A. Kirk, B. Panyanak |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34249098113&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60987 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Best approximation in ℝ-trees
by: Kirk W.A., et al.
Published: (2014) -
Erratum: Best approximation in trees (Numerical Functional Analysis and Optimization (2007) 28:5-6 (681-690))
by: W. A. Kirk, et al.
Published: (2018) -
Erratum: Best approximation in trees (Numerical Functional Analysis and Optimization (2007) 28:5-6 (681-690))
by: W. A. Kirk, et al.
Published: (2018) -
Erratum: Best approximation in trees (Numerical Functional Analysis and Optimization (2007) 28:5-6 (681-690))
by: Kirk W.A., et al.
Published: (2014) -
On multivalued nonexpansive mappings in ℝ-trees
by: K. Samanmit, et al.
Published: (2018)