Distributed asynchronous gradient algorithms for convex network flow problems

The author considers the solution of the single commodity strictly convex network flow problem. The dual of this problem is unconstrained and differentiable. It is shown that the structure of the dual problem allows the successful application of a distributed asynchronous gradient method whereby gradient iterations are carried out by several processors in arbitrary order and with arbitrarily large interprocessor communication delays.<>