Potential reduction algorithms have a distinguished role in the area of interior point methods for mathematical programming. Karmarkar’s [44] algorithm for linear programming, whose announcement in 1984 initiated a torrent of research into interior point methods, used three key ingredients: a non–standard linear programming formulation, projective transformations, and a potential function with which to measure the progress of the algorithm. It was quickly shown that the non–standard formulation… CONTINUE READING