Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition

DOI10.1287/moor.15.1.33zbMath0718.90061OpenAlexW2017849513MaRDI QIDQ5750713

Paul Tseng

Publication date: 1990

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/2978

zbMATH Keywords

distributed computationJacobi relaxationdiagonal dominance conditionsblock-coordinate relaxation algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Markov and semi-Markov decision processes (90C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items

Abelian networks. II: Halting on all inputs, Abelian Networks I. Foundations and Examples, Some aspects of parallel and distributed iterative algorithms - a survey