A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm

A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm

0.00 Avg rating0 Votes
Article ID: iaor1991690
Country: Netherlands
Volume: 47
Issue: 3
Start Page Number: 337
End Page Number: 351
Publication Date: Aug 1990
Journal: Mathematical Programming (Series A)
Authors:
Keywords: Karmarkar's method
Abstract:

In his original analysis of the projective algorithm for linear programming, Karmarkar proposed a ‘modified method’ which improved the worst-case arithmetic complexity of the original algorithm by a factor of equ1. Karmarkar's analysis of the equ2improvement is based on a primal-dual formulation, and requires that small steps be taken on each iteration. However, in practice the original algorithm can be easily applied to standard form problems, and is considerably improved by performing a linesearch on each iteration, generally leading to much larger steps. The paper shows here that by incorporating a simple safeguard, a linesearch may be performed in the modified algorithm while retaining the equ3complexity improvement over the original algorithm. It then shows that the modified algorithm, with safeguarded linesearch, can be applied directly to a standard form linear program with unknown optimal objective value. The resulting algorithm enjoys a equ4complexity advantage over standard form variants of the original algorithm.

Reviews

Required fields are marked *. Your email address will not be published.