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

DOI10.1287/MOOR.15.1.33MaRDI QIDQ5750713zbMATH OpenOpenAlexFDO

Authors 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) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15) Markov and semi-Markov decision processes (90C40)

Recommendations

• On the efficacy of distributed simplex algorithms for linear programming
• scientific article; zbMATH DE number 4176823
• Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.
• A parallel algorithm for linear programming problems
• Publication:4861609

Cited in

(7)

• Some aspects of parallel and distributed iterative algorithms - a survey
• A Fast Distributed Solver for Linear Systems Under Generalized Diagonal Dominance
• Abelian networks. II: Halting on all inputs
• Distributed Semidefinite Programming With Application to Large-Scale System Analysis
• Distributed Linearly Separable Computation
• Solving Linear Programs Using Multiparty Computation
• Abelian networks. I: Foundations and examples

This page was built for publication: Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition

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