Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
DOI10.1137/0328040zbMATH Open0725.65054OpenAlexW2033976741MaRDI QIDQ5203582FDOQ5203582
Authors: Dimitri P. Bertsekas, Paul Tseng, John N. Tsitsiklis
Publication date: 1990
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0328040
Recommendations
- scientific article; zbMATH DE number 1163097
- scientific article; zbMATH DE number 3870534
- Parallel algorithms for routing in nonblocking networks
- Parallel Algorithms for Network Routing Problems and Recurrences
- Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
- Parallel algorithms for the assignment and minimum-cost flow problems
- Asynchronous gradient algorithms for a class of convex separable network flow problems
- Parallel asynchronous algorithms for the \(K\) shortest paths problem
- An Asynchronous Parallel Algorithm for Undirected Graph Connectivity
quadratic programmingfixed pointvariational inequalityconvergence criterianonexpansive functionparallel, partially asynchronous iterative algorithmsstrictly convex cost network flow optimization
Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Numerical computation of solutions to systems of equations (65H10) Markov and semi-Markov decision processes (90C40)
Cited In (17)
- Some aspects of parallel and distributed iterative algorithms - a survey
- Congestion control for asynchronous parallel computing on workstation networks
- A unified description of iterative algorithms for traffic equilibria
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
- Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
- On unbounded delays in asynchronous parallel fixed-point algorithms
- A general asynchronous block iterative model with related convergence conditions
- Parallel synchronous algorithm for nonlinear fixed point problems
- On the convergence of asynchronous parallel iteration with unbounded delays
- Solving variational inequality and fixed point problems by line searches and potential optimization
- A convergence result for asynchronous algorithms and applications
- An Agda formalization of Üresin \& Dubois' asynchronous fixed-point theory
- On asynchronous iterations
- Parallel synchronous algorithm for nonlinear fixed point problems
- Globally convergent block-coordinate techniques for unconstrained optimization
This page was built for publication: Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203582)