| Article ID: | iaor19981316 |
| Country: | Netherlands |
| Volume: | 5 |
| Issue: | 3 |
| Start Page Number: | 187 |
| End Page Number: | 205 |
| Publication Date: | May 1996 |
| Journal: | Computational Optimization and Applications |
| Authors: | Baz Didier El |
| Keywords: | gradient methods |
We consider the single commodity strictly convex network flow problem. The dual of this problem is unconstrained, differentiable, and well suited for solution via distributed or parallel iterative methods. We present and prove convergence of gradient and asynchronous gradient algorithms for solving the dual problem. Computational results are given and analysed.