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 Wright

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)183-209
Number of pages27
JournalMathematical Programming
Volume36
Issue number2
DOIs
StatePublished - Jun 1986

Fingerprint

Barrier Methods
Newton Methods
Linear programming
Equivalence
Barrier Function
Simplex Method
Nonlinear programming
Inequality Constraints
Nonlinear Programming
Test Problems
Logarithmic
Numerical Results

Keywords

  • barrier methods
  • Karmarkar's method
  • Linear programming

ASJC Scopus subject areas

  • Mathematics(all)
  • Software
  • Engineering(all)

Cite this

On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. / Gill, Philip E.; Murray, Walter; Saunders, Michael A.; Tomlin, J. A.; Wright, Margaret.

In: Mathematical Programming, Vol. 36, No. 2, 06.1986, p. 183-209.

Research output: Contribution to journalArticle

Gill, Philip E. ; Murray, Walter ; Saunders, Michael A. ; Tomlin, J. A. ; Wright, Margaret. / On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. In: Mathematical Programming. 1986 ; Vol. 36, No. 2. pp. 183-209.
@article{c1b9331dc8784c3996d4f75dcb88a51f,
title = "On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method",
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.",
keywords = "barrier methods, Karmarkar's method, Linear programming",
author = "Gill, {Philip E.} and Walter Murray and Saunders, {Michael A.} and Tomlin, {J. A.} and Margaret Wright",
year = "1986",
month = "6",
doi = "10.1007/BF02592025",
language = "English (US)",
volume = "36",
pages = "183--209",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "2",

}

TY - JOUR

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

AU - Gill, Philip E.

AU - Murray, Walter

AU - Saunders, Michael A.

AU - Tomlin, J. A.

AU - Wright, Margaret

PY - 1986/6

Y1 - 1986/6

N2 - 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.

AB - 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.

KW - barrier methods

KW - Karmarkar's method

KW - Linear programming

UR - http://www.scopus.com/inward/record.url?scp=0022808235&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022808235&partnerID=8YFLogxK

U2 - 10.1007/BF02592025

DO - 10.1007/BF02592025

M3 - Article

VL - 36

SP - 183

EP - 209

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 2

ER -