Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems

DOI10.1016/0167-8191(93)90094-2zbMath0780.90035OpenAlexW2084966551MaRDI QIDQ688191

Didier El Baz

Publication date: 28 November 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90094-2

zbMATH Keywords

gradient algorithmstransputer networkparallel asynchronous relaxationsingle commodity strictly convex network flow

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)

Related Items

Asynchronous gradient algorithms for a class of convex separable network flow problems, A new class of asynchronous iterative algorithms with order intervals