The Homogeneous Self-Dual Method

  • Robert J. Vanderbei
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 37)


In Chapter 17, we described and analyzed an interior-point method called the path-following algorithm. This algorithm is essentially what one implements in practice but as we saw in the section on convergence analysis, it is not easy (and perhaps not possible) to give a complete proof that the method converges to an optimal solution. If convergence were completely established, the question would still remain as to how fast is the convergence. In this chapter, we shall present a similar algorithm for which a complete convergence analysis can be given.


Step Length Dual Problem Linear Programming Problem Simplex Method Interior Point Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Robert J. Vanderbei 2001

Authors and Affiliations

  • Robert J. Vanderbei
    • 1
  1. 1.Dept. of Operations Research & Financial EngineeringPrinceton UniversityUSA

Personalised recommendations