Mathematical Programming

, Volume 36, Issue 2, pp 183–209

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

Authors

  • Philip E. Gill
    • Department of Operations ResearchStanford University
  • Walter Murray
    • Department of Operations ResearchStanford University
  • Michael A. Saunders
    • Department of Operations ResearchStanford University
  • J. A. Tomlin
    • Ketron Incorporated
  • Margaret H. Wright
    • Department of Operations ResearchStanford University
Article

DOI: 10.1007/BF02592025

Cite this article as:
Gill, P.E., Murray, W., Saunders, M.A. et al. Mathematical Programming (1986) 36: 183. doi:10.1007/BF02592025

Abstract

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.

Key words

Linear programming Karmarkar’s method barrier methods

Copyright information

© The Mathematical Programming Society, Inc. 1986