DISTRIBUTED ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS.

Dimitri P. Bertsekas, Didier El Baz

Research output: Contribution to journalArticlepeer-review

46 Scopus citations

Abstract

We consider the solution of the single commodity strictly convex network flow problem in a distributed asynchronous computation environment. The dual of this problem in 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.

Original languageEnglish (US)
Pages (from-to)74-85
Number of pages12
JournalSIAM Journal on Control and Optimization
Volume25
Issue number1
DOIs
StatePublished - 1987
Externally publishedYes

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics

Fingerprint Dive into the research topics of 'DISTRIBUTED ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS.'. Together they form a unique fingerprint.

Cite this