On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

Interest in linear programming has been intensified recently by Karmarkar’s publication in 1984 of an algorithm that is claimed to be much faster than the simplex method for practical problems. We review classical barrier-function methods for nonlinear programming based on applying a logarithmic transformation to inequality constraints. For the special case of linear programming, the transformed problem can be solved by a “projected Newton barrier” method. This method is shown to be equivalent to Karmarkar’s projective method for a particular choice of the barrier parameter. We then present details of a specific barrier algorithm and its practical implementation. Numerical results are given for several non-trivial test problems, and the implications for future developments in linear programming are discussed.

[1]  C. Tompkins,et al.  Some methods of computational attack on programming problems other than the simplex method (abstract) , 1957 .

[2]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

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

[4]  G. R. Walsh,et al.  Methods Of Optimization , 1976 .

[5]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[6]  F. A. Lootsma,et al.  Numerical methods for non-linear optimization , 1974 .

[7]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .

[8]  R. Brent.  Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973) , 1975 .

[9]  Robert Mifflin.  Convergence bounds for nonlinear programming algorithms , 1975, Math. Program..

[10]  W. Murray,et al.  Efficient Linear Search Algorithms for the Logarithmic Barrier Function , 1976 .

[11]  Michel Bénichou,et al.  The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results , 1977, Math. Program..

[12]  S. Erlander.  ENTROPY IN LINEAR PROGRAMS--AN APPROACH TO PLANNING , 1977 .

[13]  K. Jittorntrum.  Sequential algorithms in nonlinear programming , 1978, Bulletin of the Australian Mathematical Society.

[14]  M. R. Osborne,et al.  Trajectory analysis and extrapolation in barrier function methods , 1978, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[15]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[16]  Jan Eriksson,et al.  A note on solution of large sparse maximum entropy problems with linear equality constraints , 1980, Math. Program..

[17]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[18]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[19]  James K. Ho,et al.  A set of staircase linear programming test problems , 1981, Math. Program..

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

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

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

[23]  Iain S. Duff,et al.  MA27 -- A set of Fortran subroutines for solving sparse symmetric sets of linear equations , 1982 .

[24]  Michael A. Saunders,et al.  Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems , 1982, TOMS.

[25]  Robert Fourer,et al.  Solving staircase linear programs by the simplex method, 1: Inversion , 1982, Math. Program..

[26]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[27]  Jon Louis Bentley,et al.  Writing efficient programs , 1982 .

[28]  Michael A. Saunders,et al.  MINOS 5. 0 user's guide , 1983 .

[29]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[30]  John A. Tomlin,et al.  Formal optimization of some reduced linear programming problems , 1983, Math. Program..

[31]  Oscar García.  A Forestry-Oriented Linear Programming Interpreter , 1984 .

[32]  Alan George,et al.  A new release of SPARSPAK: the Waterloo sparse matrix package , 1984, SGNM.

[33]  P. Gill,et al.  Sparse Matrix Methods in Optimization , 1984 .

[34]  M. Heath.  Numerical Methods for Large Sparse Linear Least Squares Problems , 1984 .

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

[36]  I. Lustig.  A Practical Approach to Karmarkar's Algorithm. , 1985 .

[37]  P. Moler.  A new species of frog (Ranidae: Rana) from Northwestern Florida , 1985 .

[38]  Jack J. Dongarra,et al.  Distribution of mathematical software via electronic mail , 1985, SGNM.

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

[40]  P. Gill,et al.  A Note on Nonlinear Approaches to Linear Programming. , 1986 .

[41]  J. Tomlin.  An experimental approach to karmarkar’s projective method for linear programming , 1987 .

[42]  P. Gill,et al.  Maintaining LU factors of a general sparse matrix , 1987 .

[43]  R. Fletcher.  Practical Methods of Optimization , 1988 .