, Volume 44, Issue 1-3, pp 27-41

Interior path following primal-dual algorithms. part I: Linear programming

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We describe a primal-dual interior point algorithm for linear programming problems which requires a total of \(O\left( {\sqrt n L} \right)\) number of iterations, whereL is the input size. Each iteration updates a penalty parameter and finds the Newton direction associated with the Karush-Kuhn-Tucker system of equations which characterizes a solution of the logarithmic barrier function problem. The algorithm is based on the path following idea.