On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
 Philip E. Gill,
 Walter Murray,
 Michael A. Saunders,
 J. A. Tomlin,
 Margaret H. Wright
 … show all 5 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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 barrierfunction 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 nontrivial test problems, and the implications for future developments in linear programming are discussed.
 Benichou, M., Gauthier, J.M., Hentges, G., Ribière, G. (1977) The efficient solution of largescale linear programming problems—some algorithmic techniques and computational results. Mathematical Programming 13: pp. 280322 CrossRef
 Bentley, J.L. (1982) Writing Efficient Programs. PrenticeHall, Englewood Cliffs, NJ
 Brent, R.P. (1973) Algorithms for Minimization without Derivatives. PrenticeHall, Englewood Cliffs, NJ
 Dantzig, G.B. (1963) Linear Programming and Extensions. Princeton University Press, Princeton, NJ
 Dongarra, J.J., Grosse, E. (1985) Distribution of mathematical software via electronic mail. SIGNUM Newsletter 20: pp. 4547
 Duff, I.S., Reid, J.K. (1982) MA27—a set of Fortran subroutines for solving sparse symmetric sets of linear equations. Computer Science and Systems Division, AERE Harwell, Harwell, England
 Duff, I.S., Reid, J.K. (1983) The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software 9: pp. 302325 CrossRef
 Eisenstat, S.C., Gursky, M.C., Schultz, M.H., Sherman, A.H. (1982) Yale sparse matrix package I: The symmetric codes. International Journal of Numerical Methods in Engineering 18: pp. 11451151 CrossRef
 Eriksson, J. (1980) A note on solution of large sparse maximum entropy problems with linear equality constraints. Mathematical Programming 18: pp. 146154 CrossRef
 Eriksson, J. (1981) Algorithms for entropy and mathematical programming. Linköping University, Linköping, Sweden
 Eriksson, J. (1985) An iterative primaldual algorithm, for linear programming. Department of Mathematics, Linköping University, Linköping, Sweden
 Erlander, S. (1977) Entropy in linear programs—an approach to planning. Department of Mathematics, Linköping University, Linköping, Sweden
 Fiacco, A.V. Barrier methods for nonlinear programming. In: Holzman, A. eds. (1979) Operations Research Support Methodology. Marcel Dekker, New York, NY, pp. 377440
 Fiacco, A.V., McCormick, G.P. (1968) Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John Wiley and Sons, New York
 Fletcher, R. (1981) Practical Methods of Optimization, Volume 2. John Wiley and Sons, Chichester
 Fletcher, R., McCann, A.P. Acceleration techniques for nonlinear programming. In: Fletcher, R. eds. (1969) Optimization. Academic Press, London, pp. 203213
 Fourer, R. (1982) Solving staircase linear programs by the simplex method, 1: Inversion. Mathematical Programming 23: pp. 274313 CrossRef
 Frisch, K.R. (1955) The logarithmic potential method of convex programming. University Institute of Economics, Oslo, Norway
 Frisch, K.R. (1957) Linear dependencies and a mechanized form of the multiplex method for linear programming. University Institute of Economics, Oslo, Norway
 Garcia, O. (1984) FOLPI, a forestryoriented linear programming interpreter. New Zealand Forest Service, Christchurch, New Zealand
 Gay, D.M. (1985) Solving sparse leastsquares problems. Department of Operations Research, Stanford University, Stanford, CA
 George, J.A., Liu, J.W.H. (1981) Computer Solution of Large Sparse Positive Definite Systems. PrenticeHall, Englewood Cliffs, NJ
 George, J.A., Ng, E. (1984) A new release of SPARSPAK—the Waterloo sparse matrix package. SIGNUM Newsletter 19: pp. 913
 Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H. (1984) Sparse matrix methods in optimization. SIAM Journal on Scientific and Statistical Computing 5: pp. 562589 CrossRef
 Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H. (1986) A note on nonlinear approaches to linear programming. Department of Operations Research, Stanford University, Stanford, CA
 Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H. (1986) Maintaining LU factors of a general sparse matrix. Department of Operations Research, Stanford University, Stanford, CA
 Gill, P.E., Murray, W., Wright, M.H. (1981) Practical Optimization. Academic Press, London
 Heath, M.T. (1984) Numerical methods for large sparse linear least squares problems. SIAM Journal on Scientific and Statistical Computing 5: pp. 497513 CrossRef
 Ho, J.K., Loute, E. (1981) A set of staircase linear programming test problems. Mathematical Programming 20: pp. 245250 CrossRef
 Hoffman, A.J., Mannos, M., Sokolowsky, D., Wiegmann, N. (1953) Computational experience in solving linear programs. Journal of the Society for Industrial and Applied Mathematics 1: pp. 1733 CrossRef
 Huard, P. Resolution of mathematical programming with nonlinear constraints by the method of centres. In: Abadie, J. eds. (1967) Nonlinear Programming. NorthHolland, Amsterdam, pp. 207219
 Jittorntrum, K. (1978) Sequential Algorithms in Nonlinear Programming. Australian National University, Canberra, Australia
 Jittorntrum, K., Osborne, M.R. (1978) Trajectory analysis and extrapolation in barrier function methods. Journal of Australian Mathematical Society Series B 20: pp. 352369 CrossRef
 N. Karmarkar, “A new polynomialtime algorithm for linear programming,”Proceedings of the 16th Annual ACM Symposium on the Theory of Computing (1984a) 302–311.
 Karmarkar, N. (1984) A new polynomialtime algorithm for linear programming. Combinatorica 4: pp. 373395 CrossRef
 Khachiyan, L.G. (1979) A polynomial algorithm in linear programming. Doklady Akademiia Nauk SSSR Novaia Seriia 244: pp. 10931096
 Liu, J.W.H. (1985) Modification of the minimumdegree algorithm by multiple elimination. ACM Transactions on Mathematical Software 11: pp. 141153 CrossRef
 Lustig, I.J. (1985) A practical approach to karmarkar’s algorithm. Department of Operations Research, Stanford University, Stanford, CA
 Mifflin, R. On the convergence of the logarithmic barrier function method. In: Lootsma, F. eds. (1972) Numerical Methods for NonLinear Optimization. Academic Press, London, pp. 367369
 Mifflin, R. (1975) Convergence bounds for nonlinear programming algorithms. Mathematical Programming 8: pp. 251271 CrossRef
 C.B. Moler, Private communication (1985).
 Murray, W., Wright, M.H. (1976) Efficient linear search algorithms for the logarithmic barrier function. Department of Operations Research, Stanford University, Stanford, CA
 Murtagh, B.A., Saunders, M.A. (1983) MINOS 5.0 user’s guide. Department of Operations Research, Stanford University, Stanford, CA
 Ortega, J.M., Rheinboldt, W.C. (1970) Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, NY
 Paige, C.C., Saunders, M.A. (1982) LSQR: An algorithm for sparse linear equations and sparse leastsquares. ACM Transactions on Mathematical Software 8: pp. 4371 CrossRef
 Paige, C.C., Saunders, M.A. (1982) Algorithm 583. LSQR: Sparse linear equations and least squares problems. ACM Transactions on Mathematical Software 8: pp. 195209 CrossRef
 Todd, M.J., Burrell, B.P. (1985) An extension of Karmarkar’s algorithm for linear programming using dual variables. School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY
 Tomlin, J.A. (1985) An experimental approach to Karmarkar’s projective method for linear programming. Manuscript, Ketron Inc., Mountain, View, CA
 Tomlin, J.A., Welch, J.S. (1983) Formal optimization of some reduced linear programming problems. Mathematical Programming 27: pp. 232240
 C.B. Tompkins, “Projection methods in calculation,” in: H.A. Antosiewicz, ed.,Proceedings of the Second Symposium in Linear Programming (United States Air Force, Washington, DC, 1955) pp. 425–448.
 Tompkins, C.B. (1957) Some methods of computational attack on programming problems, other than the simplex method. Naval Research Logistics Quarterly 4: pp. 9596
 Vanderbei, R.J., Meketon, M.S., Freedman, B.A. (1985) A modification of Karmarkar’s linear programming algorithm. AT&T Bell Laboratories, Holmdel, NJ
 Neumann, J. (1947) On a maximization problem. Institute for Advanced Study, Princeton, NJ
 Title
 On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
 Journal

Mathematical Programming
Volume 36, Issue 2 , pp 183209
 Cover Date
 19860601
 DOI
 10.1007/BF02592025
 Print ISSN
 00255610
 Online ISSN
 14364646
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Linear programming
 Karmarkar’s method
 barrier methods
 Industry Sectors
 Authors

 Philip E. Gill ^{(1)}
 Walter Murray ^{(1)}
 Michael A. Saunders ^{(1)}
 J. A. Tomlin ^{(2)}
 Margaret H. Wright ^{(3)}
 Author Affiliations

 1. Department of Operations Research, Stanford University, 94305, Stanford, CA, USA
 2. Ketron Incorporated, 94040, Mountain View, California, USA
 3. Department of Operations Research, Stanford University, 94305, Stanford, CA, USA