An implementation of a parallel primal-dual interior point method for block- structured linear programs

DOI10.1007/BF00253804zbMath0770.90044WikidataQ60140248 ScholiaQ60140248MaRDI QIDQ1203072

Guangye Li, Irvin J. Lustig

Publication date: 4 February 1993

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

parallel computationmulticommodity flowblock-structured linear programs with side constraintsprimal-dual predictor-corrector interior point method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Gigaflops in linear programming ⋮ Exploiting structure in parallel implementation of interior point methods for optimization

Uses Software

• KORBX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multicommodity network flows: The impact of formulation on decomposition
• Symmetric indefinite systems for interior point methods
• Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
• Parallel Algorithms for Sparse Linear Systems
• An Interior Point Method for Block Angular Optimization
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey

This page was built for publication: An implementation of a parallel primal-dual interior point method for block- structured linear programs