Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

DOI10.1137/0325006MaRDI QIDQ3026703zbMATH OpenOpenAlexFDO

Authors Dimitri P. Bertsekas, Didier El Baz

Publication date 1987

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0325006

zbMATH Keywords

coordinate descentasynchronous relaxationdistributed parallel computationsingle commodity minimum strictly convex cost network flow

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
• Asynchronous gradient algorithms for a class of convex separable network flow problems
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Dual coordinate step methods for linear network flow problems
• Parallel algorithms for solving the convex minimum cost flow problem

Cited in

(23)

• Some aspects of parallel and distributed iterative algorithms - a survey
• An algorithm for nonlinear programs over Cartesian product sets
• Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
• A unified description of iterative algorithms for traffic equilibria
• A partial linearization method for the traffic assignment problem
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• scientific article; zbMATH DE number 7559206 (Why is no real title available?)
• Dual coordinate step methods for linear network flow problems
• Asynchronous Broadcast-Based Convex Optimization Over a Network
• Application of the dual active set algorithm to quadratic network optimization
• Proximal minimizations with D-functions and the massively parallel solution of linear network programs
• Data parallel computing for network-structured optimization problems
• Asynchronous gradient algorithms for a class of convex separable network flow problems
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• A survey on the continuous nonlinear resource allocation problem
• A METHOD OF TERMINATING ASYNCHRONOUS ITERATIVE ALGORITHMS ON MESSAGE PASSING SYSTEMS
• A survey of dynamic network flows
• Distributed extremum seeking for constrained convex optimization with input dead-zone
• Iterative methods for linear systems of equations: a brief historical journey
• A distributed algorithm for convex network optimization problems
• Vectorization and multitasking of nonlinear network programming algorithms
• The auction algorithm: A distributed relaxation method for the assignment problem
• A new class of asynchronous iterative algorithms with order intervals

This page was built for publication: Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

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