Faigle, U.; Hunting, M.; Kern, W.; Prakash, R.; Supowit, K. - In: Computational Statistics 46 (1997) 1, pp. 131-142
Yamnitsky and Levin proposed a variant of Khachiyan's ellopsoid method for testing feasibility of systems of linear inequalities that also runs in polynomial time but uses simplices instead of ellipsoids. Starting with then-simplexS and the half-space {x¦a T x ≤ β}, the algorithm finds a...