Distributed asynchronous gradient algorithms for convex network flow problems
Published • Aug 24, 2005
NobleIDNI9P51W11R43S56
Authors:
Didier El Baz
Abstract
The author considers the solution of the single commodity strictly convex network flow problem. The dual of this problem is unconstrained and differentiable. It is shown that the structure of the dual problem allows the successful application of a distributed asynchronous gradient method whereby gra...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!