History
The ellipsoid method has a long history. As an iterative method, a preliminary version was introduced by Naum Z. Shor. In 1972, an approximation algorithm for real convex minimization was studied by Arkadi Nemirovski and David B. Yudin (Judin). As an algorithm for solving linear programming problems with rational data, the ellipsoid algorithm was studied by Leonid Khachiyan: Khachiyan's achievement was to prove the polynomial-time solvability of linear programs.
Following Khachiyan's work, the ellipsoid method was the only algorithm for solving linear programs whose runtime had been proved to be polynomial until Karmarkar's algorithm. However, the interior-point method and variants of the simplex algorithm are much faster than the ellipsoid method in practice. Karmarkar's algorithm is also faster in the worst case.
However, the ellipsoidal algorithm allows complexity theorists to achieve (worst-case) bounds that depend on the dimension of the problem and on the size of the data, but not on the number of rows, so it remained important in combinatorial optimization theory for many decades. Only in the 21st Century have interior-point algorithms with similar complexity properties appeared.
Read more about this topic: Ellipsoid Method
Famous quotes containing the word history:
“The history of reform is always identical; it is the comparison of the idea with the fact. Our modes of living are not agreeable to our imagination. We suspect they are unworthy. We arraign our daily employments.”
—Ralph Waldo Emerson (1803–1882)
“There is no history of how bad became better.”
—Henry David Thoreau (1817–1862)
“If you look at history you’ll find that no state has been so plagued by its rulers as when power has fallen into the hands of some dabbler in philosophy or literary addict.”
—Desiderius Erasmus (c. 1466–1536)