Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- 1 January 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 25 (1) , 74-85
- https://doi.org/10.1137/0325006
Abstract
We consider the solution of the single commodity strictly convex network flow problem in a distributed asynchronous computation environment. The dual ofthis problem is unconstrained, differentiable, and well suited for solution via Gauss-Seidel relaxation. We show that the structure of the dual allows the successful application of a distributed asynchronous method whereby relaxation iterations are carried out in parallel by several processors in arbitrary order and with arbitrarily large interprocessor communication delays.Keywords
This publication has 9 references indexed in Scilit:
- Distributed asynchronous deterministic and stochastic gradient optimization algorithmsIEEE Transactions on Automatic Control, 1986
- Distributed asynchronous computation of fixed pointsMathematical Programming, 1983
- Distributed dynamic programmingIEEE Transactions on Automatic Control, 1982
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problemsPublished by Springer Nature ,1982
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978
- On the convergence of sequential minimization algorithmsJournal of Optimization Theory and Applications, 1973
- On search directions for minimization algorithmsMathematical Programming, 1973
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Chaotic relaxationLinear Algebra and its Applications, 1969