The Homogeneous Self-Dual Method
In Chapter 18, 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.
KeywordsStep Length Dual Problem Linear Programming Problem Simplex Method Interior Point Method
Unable to display preview. Download preview PDF.
- Xu, X., Hung, P. & Ye, Y. (1993), A simplified homogeneous and self-dual linear programming algorithm and its implementation, Technical report, College of Business Administration, University of Iowa. To appear in Annals of Operations Research.Google Scholar
- Mehrotra, S. (1989), Higher order methods and their performance, Technical Report TR 90-16R1, Department of Ind. Eng. and Mgmt. Sci., Northwestern University, Evanston, IL. Revised July, 1991.Google Scholar