This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. Bibliography
Agmon S. “The Relaxation Method for Linear Inequalities” Canadian Journal of Mathematics, pp. 382–392, 6 (1954)
Bertsekas D.P., Gafni E.M. and Vastola K.S. “Validation of Algorithms for Optimal Routing of Flow in Networks”, Proceedings 1978 IEEE Conference on Decision and Control, San Diego, January 1979.
Ecker J.G. and Kupferschmid M. “A Computational Comparison of the Ellipsoid Method with SEveral Nonlinear Programming Algorithms”, SIAM Journal on Control and Optimization, pp. 657–674, 23 (1985).
Gafni E.M. and Bertsekas D.P. “Two-metric Projection Methods for Constrained Optimization”, SIAM Journal of Control and Optimization, pp. 936–964, 22 (1984).
Goffin J.L. “Convergence Results in a Class of Variable Metric Subgradient Methods” in Nonlinear Programming 4, Editors: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, Academic Press (1981) pp. 283–326.
Goffin J.L. “Convergence of a Cyclic Ellipsoid Algorithm for Systems of Linear Equalities”, Mathematical Programming 22, pp. 239–260, (1982).
Goffin J.L. “Convergence Rates of the Ellipsoid Method on General Convex Functions”, Mathematics of Operations Research, pp. 235–250, 8 (1983).
Goffin, J.L. “Variable Metric Relaxation Methods, Part I: A Conceptual Algorithm”, SOL Technical Report 81-16, Department of Operations Research, Stanford University, Stanford, California, U.S.A.; 101 pp.(Aug. 1981).
Held M. and Karp R.M. “The Taveling Salesman Problem and Minimum Spanning Trees: Part 2”, Mathematical Programming, pp. 6–25, 1 (1971)
Held M., Wolfe P. and Crowder H. “Validation of Subgradient Optimization”, Mathematical Programming, pp. 62–88, 6 (1974).
Hoffman A.J., Mannos D., Sokolowsky D. and Wiegman N. “Computational Experiments in Solving Linear Programs”, SIAM Journal, pp. 17–33, 1 (1953).
Khacian L.G., “A Polynomial Algorithm in Linear Programming”, Z. Vycisl. Mat. Mat. Fiz., pp. 51–68, 20 (1980); translated in USSR Comp.Math.Math.Phys., pp.53–73,20.
Motzkin T. and Schoenberg I.J. “The Relazation Method for Linear Inequalities” Canadian Journal of Mathematics, pp. 393–404, 6 (1954).
Shor N.Z. “Minimization Methods for Non-Differentiable Functions”, Springer-Verlag, Berlin, (1985).
Yudin D.B. and Nemirovskii A.S. “Estimation of the Informatinal Complexity of Mathematical Programming Problems”, Econom. i Mat. Metody, pp.128–142, 12 (1976); translated in Matekon pp. 3–25, 13.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Goffin, JL. (1986). The ellipsoid method and its predecessors. In: Contesse B., L., Correa F., R., Weintraub P., A. (eds) Recent Advances in System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006784
Download citation
DOI: https://doi.org/10.1007/BFb0006784
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17083-9
Online ISBN: 978-3-540-47201-8
eBook Packages: Springer Book Archive