A parallel interior point algorithm for linear programming on a network of transputers

DOI10.1007/BF02024486zbMath0784.90048MaRDI QIDQ1309858

L. D. J. C. Loyens, Rob H. Bisseling, Timothy Mark Doup

Publication date: 6 January 1994

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

zbMATH Keywords

Cholesky factorizationinterior point algorithmsmatrix multiplicationlarge-scale linear programmingtriangular system solvingparallel dual affine algorithm

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Parallel numerical computation (65Y05)

Related Items

Gigaflops in linear programming ⋮ Varying the \(s\) in your \(s\)-step GMRES

Uses Software

• NETLIB LP Test Set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• The formal development of a parallel program performing LU-decomposition
• An implementation of Karmarkar's algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Parallel Sparse LU Decomposition on a Mesh Network of Transputers
• A Fan-In Algorithm for Distributed Sparse Numerical Factorization
• SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
• Parallel Triangular System Solving on a Mesh Network of Transputers
• The Role of Elimination Trees in Sparse Factorization
• Modification of the minimum-degree algorithm by multiple elimination
• A compact row storage scheme for Cholesky factors using elimination trees
• Data-flow algorithms for parallel matrix computation
• An experimental approach to karmarkar’s projective method for linear programming
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• The Evolution of the Minimum Degree Ordering Algorithm
• A New Implementation of Sparse Gaussian Elimination
• Parallel Algorithms for Sparse Linear Systems
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: A parallel interior point algorithm for linear programming on a network of transputers