Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems

DOI10.1137/0328040zbMath0725.65054OpenAlexW2033976741MaRDI QIDQ5203582

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

zbMATH Keywords

quadratic programmingconvergence criteriafixed pointvariational inequalitynonexpansive functionparallel, partially asynchronous iterative algorithmsstrictly convex cost network flow optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Markov and semi-Markov decision processes (90C40) Parallel numerical computation (65Y05)

Related Items

Globally convergent block-coordinate techniques for unconstrained optimization, 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, On the convergence of asynchronous parallel iteration with unbounded delays, Solving variational inequality and fixed point problems by line searches and potential optimization, ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates, A general asynchronous block iterative model with related convergence conditions, On asynchronous iterations, Some aspects of parallel and distributed iterative algorithms - a survey, A unified description of iterative algorithms for traffic equilibria