Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems

DOI10.1016/0167-8191(93)90094-2zbMATH Open0780.90035OpenAlexW2084966551MaRDI QIDQ688191FDOQ688191

Authors: Didier El Baz 

Publication date: 28 November 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90094-2

Recommendations

• Asynchronous gradient algorithms for a class of convex separable network flow problems
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Parallel algorithms for solving the convex minimum cost flow problem
• Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
• Dual coordinate step methods for linear network flow problems

zbMATH Keywords

gradient algorithmsparallel asynchronous relaxationsingle commodity strictly convex network flowtransputer network

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Deterministic network models in operations research (90B10) Network design and communication in computer systems (68M10)

Cited In (6)

• Dual coordinate step methods for linear network flow problems
• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
• Asynchronous gradient algorithms for a class of convex separable network flow problems
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• A distributed algorithm for convex network optimization problems
• A new class of asynchronous iterative algorithms with order intervals

This page was built for publication: Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688191)