On Khachian's algorithm and minimal ellipsoids
暂无分享,去创建一个
SummaryKhachian's algorithm for solving a system of linear inequalities is accelerated by choosing smaller ellipsoids than in the original version. Furthermore, certain inequalities can be successively eliminated, from the constraints, yielding a different stopping rule.
[1] P. Gács,et al. Khachian's Algorithm for Linear Programming. , 1979 .
[2] M. Todd,et al. Modifications and Implementation of the Shor-Khachian Algorithm for Linear Programming , 1980 .
[3] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .