Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

DOI10.1137/0325006zbMath0624.90028OpenAlexW1970403725MaRDI QIDQ3026703

Didier El Baz, Dimitri P. Bertsekas

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

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

Related Items (19)

Data parallel computing for network-structured optimization problems ⋮ 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 ⋮ A METHOD OF TERMINATING ASYNCHRONOUS ITERATIVE ALGORITHMS ON MESSAGE PASSING SYSTEMS ⋮ Dual coordinate step methods for linear network flow problems ⋮ Vectorization and multitasking of nonlinear network programming algorithms ⋮ Asynchronous gradient algorithms for a class of convex separable network flow problems ⋮ Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. ⋮ Relaxation methods for problems with strictly convex separable costs and linear constraints ⋮ A survey of dynamic network flows ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A new class of asynchronous iterative algorithms with order intervals ⋮ A partial linearization method for the traffic assignment problem ⋮ An algorithm for nonlinear programs over Cartesian product sets ⋮ Unnamed Item ⋮ Iterative methods for linear systems of equations: A brief historical journey ⋮ Some aspects of parallel and distributed iterative algorithms - a survey ⋮ The auction algorithm: A distributed relaxation method for the assignment problem ⋮ A unified description of iterative algorithms for traffic equilibria

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