Fixed points, selections and best approximation for multivalued mappings in \(R\)-trees (Q2643464)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fixed points, selections and best approximation for multivalued mappings in \(R\)-trees
scientific article

    Statements

    Fixed points, selections and best approximation for multivalued mappings in \(R\)-trees (English)
    0 references
    23 August 2007
    0 references
    An \(R\)-tree is a metric space \(M\) such that there is a unique segment \([x,y]\) joining each pair of points \(x,y \in M\) and, if \([y,x]\cap [x,z]=\{x\}\), then \([y,x]\cup [x,z]= [y,z]\). A subset \(X\) of \(M\) is called convex if \(X\) includes every geodesic segment joining any two of its points. Several results concerning selections, best approximation and fixed points for multifunctions with convex values are presented. In particular, if \(M\) is a complete \(R\)-tree, then every almost lower semicontinuous multifunction with closed bounded convex values admits a continuous selection. Moreover, if the multifunction is nonexpansive, then it admits a fixed point.
    0 references
    0 references
    R-tree
    0 references
    multivalued mapping
    0 references
    best approximation
    0 references
    fixed point
    0 references
    continuous selection
    0 references
    nonexpansive
    0 references
    almost lower semicontinuity
    0 references
    0 references

    Identifiers