Abstract
The affine scaling algorithm is the first interior point algorithm in the world proposed by the Russian mathematician Dikin in 1967. The algorithm is simple and efficient, and is known as the first interior point algorithm which suggested that an interior point algorithm can outperform the existing simplex algorithm. The polynomiality status of the algorithm is still an open question, but a number of papers have revealed its deep and beautiful mathematical structures related to other interior point algorithms. In this paper we survey interesting convergence results on the affine scaling algorithm
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
