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: | Kirk W.A., Panyanak B. |
---|---|
Format: | Article |
Language: | English |
Published: |
2014
|
Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-34249098113&partnerID=40&md5=fa3d6f01b2140fd5433b5e8adf14463d http://cmuir.cmu.ac.th/handle/6653943832/5265 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Language: | English |
Similar Items
-
Best approximation in ℝ-trees
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) -
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) -
On multivalued nonexpansive mappings in ℝ-trees
by: Samanmit K., et al.
Published: (2014)