Interior-Point Methods for Linear Optimization
The development of the last 30 years has been greatly influenced by the aftermath of a “scientific earthquake” which was triggered in 1979 by the findings of the Russian mathematician Khachiyan (1952–2005) and in 1984 by those of the Indian-born mathematician Karmarkar. The New York Times, which profiled Khachiyan’s achievement in a November 1979 article entitled “Soviet Mathematician Is Obscure No More,” called him “the mystery author of a new mathematical theorem that has rocked the world of computer analysis.”
KeywordsDual Problem Primal Problem Feasible Point Linear Optimization Central Path
Unable to display preview. Download preview PDF.
- Son.G. Sonnevend (1986): An ‘Analytical Center’ for Polyhedrons and New Classes of Global Algorithms for Linear (Smooth, Convex) Programming. Lecture Notes in Control and Information Sciences 84. Springer, Berlin, Heidelberg, New York, pp. 866–875Google Scholar
- RTV.C. Roos, T. Terlaky, J. P. Vial (2005): Interior Point Methods for Linear Optimization. Springer, Berlin, Heidelberg, New YorkGoogle Scholar
- Meh.S. Mehrotra (1992): On the Implementation of a Primal-Dual Interior-Point Method. SIAM J. Optimization 2, pp. 575–601Google Scholar