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.
Publié le : 1996-01-01
Classification:
convex network flow problems,
nonlinear optimization,
asynchronous iterative algorithms,
parallel gradient method,
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC],
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{hal-01152931,
author = {El Baz, Didier},
title = {Asynchronous gradient algorithms for a class of convex separable network flow problems},
journal = {HAL},
volume = {1996},
number = {0},
year = {1996},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-01152931}
}
El Baz, Didier. Asynchronous gradient algorithms for a class of convex separable network flow problems. HAL, Tome 1996 (1996) no. 0, . http://gdmltest.u-ga.fr/item/hal-01152931/