Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming

In this work we devise efficient algorithms for finding the search directions for interior point methods applied to linear programming problems. There are two innovations. The first is the use of updating of preconditioners computed for previous barrier parameters. The second is an adaptive automated procedure for determining whether to use a direct or iterative solver, whether to reinitialize or update the preconditioner, and how many updates to apply. These decisions are based on predictions of the cost of using the different solvers to determine the next search direction, given costs in determining earlier directions. We summarize earlier results using a modified version of the OB1-R code of Lustig, Marsten, and Shanno, and we present results from a predictor–corrector code PCx modified to use adaptive iteration. If a direct method is appropriate for the problem, then our procedure chooses it, but when an iterative procedure is helpful, substantial gains in efficiency can be obtained.

[1]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[2]  Roland W. Freund,et al.  A QMR-based interior-point algorithm for solving linear programs , 1997, Math. Program..

[3]  Philip E. Gill,et al.  Newton-type methods for unconstrained and linearly constrained optimization , 1974, Math. Program..

[4]  Barry W. Peyton,et al.  Block sparse Cholesky algorithms on advanced uniprocessor computers , 1991 .

[5]  Gene H. Golub,et al.  Matrix computations , 1983 .

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

[7]  R. Vanderbei.  LOQO:an interior point code for quadratic programming , 1999 .

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

[9]  Michael A. Saunders,et al.  LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[10]  Sanjay Mehrotra,et al.  A relaxed version of Karmarkar's method , 1988, Math. Program..

[11]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

[12]  Weichung Wang,et al.  Adaptive use of iterative methods in interior point methods for linear programming , 1995 .

[13]  L. Portugal,et al.  A truncated primal‐infeasible dual‐feasible network interior point method , 2000 .

[14]  Jack J. Dongarra,et al.  Automatically Tuned Linear Algebra Software , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[15]  V. Klema.  LINPACK user's guide , 1980 .

[16]  Iain S. Duff,et al.  Direct methods for sparse matrices27100 , 1986 .

[17]  Stephen G. Nash,et al.  Preconditioning Reduced Matrices , 1996, SIAM J. Matrix Anal. Appl..

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

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

[20]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[21]  Stephen J. Wright,et al.  PCx user guide , 1997 .

[22]  David F. Shanno,et al.  An interior point method for quadratic programs based on conjugate projected gradients , 1993, Comput. Optim. Appl..

[23]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[24]  Linda Kaufman,et al.  Cholesky factor updating techniques for rank 2 matrix modifications , 1989 .

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

[26]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[27]  Sanjay Mehrotra,et al.  Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods , 1992, INFORMS J. Comput..

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

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

[30]  Steven G. Johnson,et al.  The Fastest Fourier Transform in the West , 1997 .

[31]  Philip E. Gill,et al.  Practical optimization , 1981 .

[32]  Margaret H. Wright,et al.  Interior methods for constrained optimization , 1992, Acta Numerica.

[33]  Y. Danieli.  Guide , 2005 .

[34]  K. G. Ramakrishnan,et al.  Computational results of an interior point algorithm for large scale linear programming , 1991, Math. Program..

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

[36]  Clóvis C. Gonzaga,et al.  Path-Following Methods for Linear Programming , 1992, SIAM Rev..