Asynchronous gradient algorithms for a class of convex separable network flow problems
Résumé
We consider the single commodity strictly convex network flow problem. The dual of this problem is unconstrained differentiable and well suited to solution via distriuted or parallel or iterative methods. We present and prove convergence of gradient and asynchronous gradient algorithm for solving the dual problem. Computational results are given and analyzed.
Origine | Fichiers produits par l'(les) auteur(s) |
---|