Distributed computation of fixed points of \(\infty\)-nonexpansive maps (Q1126318): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Vivek S. Borkar / rank | |||
Property / reviewed by | |||
Property / reviewed by: Florica Luban / rank | |||
Property / author | |||
Property / author: Vivek S. Borkar / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Florica Luban / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4001523 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999474 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Managing interprocessor delays in distributed recursive algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analog scheme for fixed-point computation-Part II: Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4114574 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02867437 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064782005 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:53, 30 July 2024
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
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
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