The Mathematical Institute, University of Oxford, Eprints Archive

Some Disadvantages of a Mehrotra-Type Primal-Dual Corrector Interior Point Algorithm for Linear Programming

Cartis, Coralia (2004) Some Disadvantages of a Mehrotra-Type Primal-Dual Corrector Interior Point Algorithm for Linear Programming. Technical Report. Unspecified. (Submitted)

[img]
Preview
PDF
274Kb

Abstract

The Primal-Dual Corrector (PDC) algorithm that we propose computes on each iteration a corrector direction in addition to the direction of the standard primal-dual path-following interior point method (Kojima et al., 1989) for Linear Programming (LP), in an attempt to improve performance. The new iterate is chosen by moving along the sum of these directions, from the current iterate. This technique is similar to the construction of Mehrotra's highly popular predictor-corrector algorithm (Mehrotra, 1991). We present examples, however, that show that the PDC algorithm may fail to converge to a solution of the LP problem, in both exact and finite arithmetic, regardless of the choice of stepsize that is employed. The cause of this bad behaviour is that the correctors exert too much influence on the direction in which the iterates move.

The author was supported through grant GR/S34472 from the Engineering and Physical Sciences Research Council of the UK

Item Type:Technical Report (Technical Report)
Subjects:H - N > Numerical analysis
Research Groups:Numerical Analysis Group
ID Code:1156
Deposited By:Lotti Ekert
Deposited On:14 May 2011 08:46
Last Modified:14 May 2011 08:46

Repository Staff Only: item control page