Potential Reduction Algorithms ∗

  title={Potential Reduction Algorithms ∗},
  author={Kurt M. Anstreicher},
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
8 Citations
90 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 90 references

Long–step strategies in interior point potential– reduction algorithms

  • Y. E. Nesterov
  • Dept. SES-COMIN, University of Geneva (Geneva…
  • 1993
Highly Influential
5 Excerpts

A partial updating algorithm for linear programs with many more variables than constraints

  • R. A. Bosch, K. M. Anstreicher
  • Optimization Methods and Software 4 (1995) 243…
  • 1995
Highly Influential
17 Excerpts

Similar Papers

Loading similar papers…