The ellipsoid method and its predecessors

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

[2]  J. Goffin.  CONVERGENCE RESULTS IN A CLASS OF VARIABLE METRIC SUBGRADIENT METHODS , 1981 .

[3]  Jean-Louis Goffin,et al.  Convergence Rates of the Ellipsoid Method on General Convex Functions , 1983, Math. Oper. Res..

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

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

[6]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[7]  J. Ecker,et al.  A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms , 1985 .

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

[9]  D. Bertsekas,et al.  TWO-METRIC PROJECTION METHODS FOR CONSTRAINED OPTIMIZATION* , 1984 .

[10]  Jean-Louis Goffin.  Convergence of a cyclic ellipsoid algorithm for systems of linear equalities , 1982, Math. Program..

[11]  Jean-Louis Goffin.  Variable Metric Relaxation Methods. Part I. A Conceptual Algorithm. , 1981 .

[12]  Eli Gafni,et al.  Validation of algorithms for optimal routing of flow in networks , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[13]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..