Asynchronous gradient algorithms for a class of convex separable network flow problems |
| |
| Authors: | Didier El Baz |
| |
| Affiliation: | (1) LAAS du CNRS, 7, avenue du Colonel Roche, 31077 Toulouse, Cedex, France |
| |
| Abstract: | 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. |
| |
| Keywords: | network flow problems distributed algorithms parallel computation asynchronous iterative methods gradient methods |
| 本文献已被 SpringerLink 等数据库收录！ |
|
