Asynchronous gradient algorithms for a class of convex separable network flow problems

Didier El Baz (1)

1 LAAS-CDA - Équipe Calcul Distribué et Asynchronisme

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.

Mots clés: asynchronous iterative algorithms; parallel gradient method; nonlinear optimization; convex network flow problems

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Optimisation et contrôle [math.OC]

Didier El Baz. Asynchronous gradient algorithms for a class of convex separable network flow problems. Computational Optimization and Applications, 1996, 5, pp. 187-205. ⟨hal-01152931⟩