The question is related to this algorithm in linear optimization. In the algorithm, projective transformations are used as said by wikipedia:
Since the actual algorithm is rather complicated, researchers looked for a more intuitive version of it, and in 1985 developed affine scaling, a version of Karmarkar's algorithm that uses affine transformations where Karmarkar used projective ones, only to realize four years later that they had rediscovered an algorithm published by Soviet mathematician I. I. Dikin in 1967.[14] The affine-scaling method can be described succinctly as follows.[15] While applicable to small scale problems, it is not a polynomial time algorithm
Could some details be given on the role of projective transformations here?
