The interior point method for LP on parallel computers

  • R. Levkovitz
  • J. Andersen
  • G. Mitra
II Mathematical Programming II.3 Linear Programming And Complementarity
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 180)


In this paper we describe a unified algorithmic framework for the interior point method (IPM) over a range of computer architectures. In the inner iteration of the IPM a search direction is computed using Newton or higher order methods. Computationally this involves solving a sparse symmetric positive definite (SSPD) system of equations. The choice of direct and indirect methods for the solution of this system and the design of data structures to take advantage of coarse grain parallel and massively parallel computer architectures are considered in detail. Finally, we present experimental results of solving NETLIB test problems on examples of these architectures and put forward arguments as to why integration of the system within sparse simplex is important.


Interior Point Method Super Node Conjugate Gradient Iteration Zero Structure Elimination Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Karmarkar N., A New Polynomial Time Algorithm For Linear Programming, Combinatorica, vol 4,pp 373–379, 1984zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Lustig J. I., Marsten E. R.,Shanno D.F., On Implementing Mehrotra’s Predictor-Corrector Interior Point Method For Linear Programming, Technical Report SOR 90-03, Department of Civil Engineering and Operational Research, Princeton University, 1990Google Scholar
  3. [3]
    Bixby R.E., Gregory J.W.,Lustig I.J.,Marsten R.E.,Shanno D.F., Very Large Scale Linear Programming: A Case Study In Combining Interior Point And Simplex Methods, Department of Mathematical Science, Rice University, Texas, 1991Google Scholar
  4. [4]
    Andersen J., Levkovitz R., Mitra G., Tamiz M., Adapting IPM For The Solution Of LPs On Serial,Coarse Grain Parallel And Massively Parallel Computer, Brunel University, 1990.Google Scholar
  5. [5]
    George J.A., Liu J.W.,Computer Solution Of Large Sparse Positive Definite Systems, Prentice Hall,1981Google Scholar
  6. [6]
    Monteiro D.C., Adler I., Interior Path Following Primal-Dual Algorithm, Mathematical Programming 44, 1989Google Scholar
  7. [7]
    Megiddo N., On Finding Primal-Dual and Dual-Optimal Bases. ORSA Journal on Computing No2, Winter 1991.Google Scholar
  8. [8]
    Liu W. H., Reordering Sparse Matrices For Parallel Elimination, Parallel Computing, Volume 11, pp73–91, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    Andersen J.H.,Mitra G.,Parkinson D.,The Scheduling Of Sparse Matrix-Vector Multiplication On a Massively Parallel DAP Computer, Brunel University, 1991.Google Scholar
  10. [10]
    Golub J., Van-Loan C.F.,Matrix Computation, North Oxford Academic, 1983.Google Scholar
  11. [11]
    Lai C.H., Liddell H.M., Preconditioned Conjugate Gradient Methods On The DAP, Proceeding From The Mathematics Of Finite Elements & Applications, Vol 4. pp 147–156,1988Google Scholar
  12. [12]
    Mitra G.,Levkovitz R.,Tamiz M.,Integration Of IPM Within Simplex, Experiments In Feasible Basis Recovery, Brunel University, Presented to 14’th MPS Symposium,1991.Google Scholar

Copyright information

© International Federation for Information Processing 1992

Authors and Affiliations

  • R. Levkovitz
    • 1
  • J. Andersen
    • 1
  • G. Mitra
    • 1
  1. 1.Brunel - The University Of West LondonU.K.

Personalised recommendations