Implementation of Interior Point Methods for Large Scale Linear Programming

In this paper we give an overview of the mostimportant characteristics of advanced implementations of interior point methods.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  A. Tucker,et al.  Linear Inequalities And Related Systems , 1956 .

[4]  A. J. Goldman,et al.  Polyhedral Convex Cones , 1956 .

[5]  A. J. Goldman,et al.  4. Theory of Linear Programming , 1957 .

[6]  H. Markowitz.  The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

[7]  A. Tucker.  1 . Dual Systems of Homogeneous Linear Relations , 1957 .

[8]  J. W. Walker,et al.  Direct solutions of sparse network equations by optimally ordered triangular factorization , 1967 .

[9]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[10]  G. Stewart.  Modifying pivot elements in Gaussian elimination , 1974 .

[11]  Gautam Mitra,et al.  Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..

[12]  Åke Bjürck.  METHODS FOR SPARSE LINEAR LEAST SQUARES PROBLEMS , 1976 .

[13]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[14]  Stanley C. Eisenstat,et al.  Yale sparse matrix package I: The symmetric codes , 1982 .

[15]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[16]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[17]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[18]  J. L. Nazareth.  Computer solution of linear programs , 1987 .

[19]  M. Kojima,et al.  A primal-dual interior point algorithm for linear programming , 1988 .

[20]  Mauricio G. C. Resende,et al.  Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm , 1989, INFORMS J. Comput..

[21]  G. Stewart.  On scaled projections and pseudoinverses , 1989 .

[22]  Alan George,et al.  The Evolution of the Minimum Degree Ordering Algorithm , 1989, SIAM Rev..

[23]  Jeffrey C. Lagarias,et al.  Power series variants of Karmarkar-type algorithms , 1989, AT&T Technical Journal.

[24]  Clyde L. Monma,et al.  An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..

[25]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[26]  Nimrod Megiddo,et al.  Progress in Mathematical Programming , 1989 .

[27]  I. Duff,et al.  On the augmented system approach to sparse least-squares problems , 1989 .

[28]  Sanjay Mehrotra,et al.  Higher order methods and their performance , 1990 .

[29]  Uwe H. Suhl,et al.  Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases , 1990, INFORMS J. Comput..

[30]  J. Goffin,et al.  Cutting planes and column generation techniques with the projective algorithm , 1990 .

[31]  Clyde L. Monma,et al.  Further Development of a Primal-Dual Interior Point Method , 1990, INFORMS J. Comput..

[32]  E. Christiansen,et al.  Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm , 1991 .

[33]  K. Turner.  Computing projections for the Karmarkar algorithm , 1991 .

[34]  Sanjay Mehrotra.  Handling free variables in interior methods , 1991 .

[35]  Janet E. Rogers,et al.  Optimizing Over Three-Dimensional Subspaces in an Interior-Point Method for Linear Programming* , 1991 .

[36]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[37]  I. Duff,et al.  The factorization of sparse symmetric indefinite matrices , 1991 .

[38]  R. Vanderbei.  Splitting dense columns in sparse linear systems , 1991 .

[39]  Joseph W. H. Liu,et al.  A generalized envelope method for sparse factorization by rows , 1991, TOMS.

[40]  Mauricio G. C. Resende,et al.  An Efficient Implementation of a Network Interior Point Method , 1991, Network Flows And Matching.

[41]  Anoop Gupta,et al.  Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy , 1991, TOMS.

[42]  Nimrod Megiddo,et al.  On Finding Primal- and Dual-Optimal Bases , 1991, INFORMS J. Comput..

[43]  S. Thomas McCormick,et al.  A hierarchical algorithm for making sparse matrices sparser , 1992, Math. Program..

[44]  Donald Goldfarb,et al.  Steepest-edge simplex algorithms for linear programming , 1992, Math. Program..

[45]  Yinyu Ye,et al.  On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..

[46]  John A. Tomlin,et al.  Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library , 1992, IBM Syst. J..

[47]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[48]  Robert J. Vanderbei,et al.  Prior reduced fill-in in solving equations in interior point algorithms , 1992, Operations Research Letters.

[49]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[50]  Shinji Mizuno,et al.  A primal—dual infeasible-interior-point algorithm for linear programming , 1993, Math. Program..

[51]  Sanjay Mehrotra,et al.  Solving symmetric indefinite systems in an interior-point method for linear programming , 1993, Math. Program..

[52]  John M. Mulvey,et al.  Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure , 1993, INFORMS J. Comput..

[53]  Robert J. Vanderbei,et al.  Symmetric indefinite systems for interior point methods , 1993, Math. Program..

[54]  Tamás Terlaky,et al.  An interior point approach to postoptimal and parametric analysis in linear programming Report 92-21 , 1993 .

[55]  Barry W. Peyton,et al.  A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors , 1991, SIAM J. Sci. Comput..

[56]  Yinyu Ye,et al.  Convergence behavior of interior-point algorithms , 1993, Math. Program..

[57]  Robert E. Bixby,et al.  Progress in Linear Programming , 1993 .

[58]  Roy E. Marsten,et al.  COLDSTART -- FLEET ASSIGNMENT AT DELTA AIR LINES. , 1994 .

[59]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

[60]  Uwe H. Suhl,et al.  MOPS -- Mathematical optimization system , 1994 .

[61]  B. Jansen,et al.  The theory of linear programming:skew symmetric self-dual problems and the central path * , 1994 .

[62]  J. Gondzio,et al.  Presolove Analysis of Linear Programs Prior to Applying an Interior Point Method , 1997, INFORMS J. Comput..

[63]  Robert E. Bixby,et al.  Recovering an optimal LP basis from an interior point solution , 1994, Oper. Res. Lett..

[64]  Robert E. Bixby,et al.  Commentary - Progress in Linear Programming , 1994, INFORMS J. Comput..

[65]  Yin Zhang,et al.  A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..

[66]  Harvey J. Greenberg,et al.  The use of the optimal partition in a linear programming solution for postoptimal analysis , 1994, Oper. Res. Lett..

[67]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[68]  Erling D. Andersen,et al.  Presolving in linear programming , 1995, Math. Program..

[69]  J. Gondzio.  HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method , 1995 .

[70]  Yinyu Ye,et al.  A generalized homogeneous and self-dual algorithm for linear programming , 1995, Oper. Res. Lett..

[71]  E. Andersen.  Finding all linearly dependent rows in large-scale linear programming , 1995 .

[72]  Jacek Gondzio,et al.  Multiple centrality corrections in a primal-dual method for linear programming , 1996, Comput. Optim. Appl..

[73]  C. Mészáros.  Fast Cholesky factorization for interior point methods of linear programming , 1996 .

[74]  Yinyu Ye,et al.  A simplified homogeneous and self-dual linear programming algorithm and its implementation , 1996, Ann. Oper. Res..

[75]  Gisela Engeln-Müllges,et al.  Direct Methods for Solving Systems of Linear Equations , 1996 .

[76]  Joaquim Júdice,et al.  An Investigation of Interior-Point Algorithms for the Linear Transportation Problem , 1996, SIAM J. Sci. Comput..

[77]  Knud D. Andersen.  A modified Schur-complement method for handling dense columns in interior-point methods for linear programming , 1996, TOMS.

[78]  Robert M. Freund,et al.  Interior point methods : current status and future directions , 1996 .

[79]  Jean-Philippe Vial,et al.  Primal-dual target-following algorithms for linear programming , 1996, Ann. Oper. Res..

[80]  Olivier du Merle,et al.  A Short Note on the Comparative Behaviour of Kelley's Cutting Plane Method and the Analytic Center Cutting Plane Method , 1996 .

[81]  Y. Ye,et al.  Combining Interior-Point and Pivoting Algorithms for Linear Programming , 1996 .

[82]  Yinyu Ye,et al.  An Asymptotical O(√(n) L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods , 1996, SIAM J. Optim..

[83]  C. Mészáros.  The augmented system variant of IPMs in two-stage stochastic linear programming computation , 1997 .

[84]  István Maros,et al.  The role of the augmented system in interior point methods , 1998, Eur. J. Oper. Res..

[85]  Sonnevend G. Stoer J.,et al.  Subspace methods for solving linear programming problems , 1998 .