Distributed computation of fixed points of \(\infty\)-nonexpansive maps (Q1126318)

From MaRDI portal
Revision as of 16:12, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Distributed computation of fixed points of \(\infty\)-nonexpansive maps
scientific article

    Statements

    Distributed computation of fixed points of \(\infty\)-nonexpansive maps (English)
    0 references
    0 references
    19 January 1997
    0 references
    The paper deals with a distributed implementation of an algorithm for finding a fixed point of a \(\text{map }F: \mathbb{R}^d\to \mathbb{R}^d\) which is nonexpansive with respect to the \(\infty\)-norm. It is proved that the proposed algorithm converges to the set of fixed points under general conditions. Finally, it is shown that numerical analysis and optimization problems such as shortest path problems, Markov decision processes, systems of linear equations, strictly convex network flow problems can be cast as problems of finding fixed points of \(\infty\)-nonexpansive maps.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    fixed point
    0 references
    shortest path problems
    0 references
    Markov decision processes
    0 references
    systems of linear equations
    0 references
    strictly convex network flow problems
    0 references
    nonexpansive maps
    0 references
    0 references
    0 references