Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60987
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | W. A. Kirk | en_US |
dc.contributor.author | B. Panyanak | en_US |
dc.date.accessioned | 2018-09-10T04:02:28Z | - |
dc.date.available | 2018-09-10T04:02:28Z | - |
dc.date.issued | 2007-05-01 | en_US |
dc.identifier.issn | 15322467 | en_US |
dc.identifier.issn | 01630563 | en_US |
dc.identifier.other | 2-s2.0-34249098113 | en_US |
dc.identifier.other | 10.1080/01630560701348517 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34249098113&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/60987 | - |
dc.description.abstract | 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 ℝ-tree H, and suppose T:X2H is a multivalued upper semicontinuous mapping whose values are nonempty closed convex subsets of X. Then there exists a point x0X such that [image omitted] We also give a topological version of the above theorem in a more abstract setting, and we prove a KKM theorem for geodesically bounded ℝ-trees. | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Mathematics | en_US |
dc.title | Best approximation in ℝ-trees | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | Numerical Functional Analysis and Optimization | en_US |
article.volume | 28 | en_US |
article.stream.affiliations | University of Iowa | en_US |
article.stream.affiliations | Chiang Mai University | en_US |
Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.