The Ellipsoid Method: A Survey

IN February 1979 a note by L.G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in polynomial time. This result has caused great excitement and stimulated a flood of technical papers. Ordinarily there would be no need for a survey of work so recent. The current circumstances are obviously exceptional. Word of Khachiyan''s result has spread extraordinarily fast, much faster than comprehension of its significance. A variety of issues have in general not been well understood, including the exact character of the ellipsoid method and of Khachiyan''s result on polynomiality, its practical significance in linear programming, its implementation, its potential applicability to problems outside of the domain of linear programming, and its relationship to earlier work. Our aim here is to help clarify these important issues in the context of a survey of the ellipsoid method, its historical antecedents, recent developments, and current research.

[1]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .

[2]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[3]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[4]  I. Niven,et al.  An introduction to the theory of numbers , 1961 .

[5]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[6]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[7]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[8]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[9]  T. C. Hu,et al.  Synthesis of a Communication Network , 1964 .

[10]  D. J. Newman,et al.  Location of the Maximum on Unimodal Surfaces , 1965, JACM.

[11]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[12]  Yu. M. Ermol’ev.  Methods of solution of nonlinear extremal problems , 1966 .

[13]  N. Z. Shor.  The rate of convergence of the generalized gradient descent method , 1968 .

[14]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[15]  Stephen A. Cook,et al.  Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions , 1969 .

[16]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[17]  N. Z. Shor.  Convergence rate of the gradient descent method with dilatation of the space , 1970 .

[18]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[19]  N. Z. Shor,et al.  A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients , 1971 .

[20]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[21]  R. Bartels.  A stabilization of the simplex method , 1971 .

[22]  N. Z. Shor.  Utilization of the operation of space dilatation in the minimization of convex functions , 1972 .

[23]  Norman Zadeh,et al.  A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..

[24]  Robert G. Jeroslow,et al.  The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..

[25]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[26]  V. A. Skokov.  Note on minimization methods employing space stretching , 1974 .

[27]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[28]  P. Gill,et al.  Methods for computing and modifying the $LDV$ factors of a matrix , 1975 .

[29]  C. Lemaréchal.  An extension of davidon methods to non differentiable problems , 1975 .

[30]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[31]  N. Z. Shor.  Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[32]  N. Shor.  New development trends in nondifferentiable optimization , 1977 .

[33]  V. Chvátal,et al.  Notes on Bland’s pivoting rule , 1978 .

[34]  S. N. Maheshwari,et al.  An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[35]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[36]  W. H. Cunningham,et al.  Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..

[37]  William Y. Sit,et al.  Worst case behavior of the steepest edge simplex method , 1979, Discret. Appl. Math..

[38]  N. Z. Shor,et al.  Family of algorithms for solving convex programming problems , 1979 .

[39]  H. König,et al.  On Khachian's algorithm and minimal ellipsoids , 1980 .

[40]  M. Todd,et al.  Modifications and Implementation of the Shor-Khachian Algorithm for Linear Programming , 1980 .

[41]  L. Lovász.  A new linear programming algorithm — better or worse than the Simplex Method? , 1980 .

[42]  Eugene L. Lawler.  The Great Mathematical Sputnik of 1979 , 1980 .

[43]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[44]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[45]  P. Gács,et al.  Khachiyan’s algorithm for linear programming , 1981 .