{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T12:02:07Z","timestamp":1778155327143,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1007\/bf01583776","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:31:20Z","timestamp":1114677080000},"page":"1-19","source":"Crossref","is-referenced-by-count":49,"title":["Modifications and implementation of the ellipsoid algorithm for linear programming"],"prefix":"10.1007","volume":"23","author":[{"given":"Donald","family":"Goldfarb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Todd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon","year":"1954","unstructured":"S. Agmon, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR2","volume-title":"Nondifferentiable optimization, Mathematical Programming Study 3","year":"1975","unstructured":"M.L. Balinski and P. Wolfe, eds.,Nondifferentiable optimization, Mathematical Programming Study 3 (North-Holland, Amsterdam, 1975)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01436076","volume":"7","author":"J.M. Bennett","year":"1965","unstructured":"J.M. Bennett, \u201cTriangular factors of modified matrices\u201d,Numerische Mathematik 7 (1965) 217\u2013221.","journal-title":"Numerische Mathematik"},{"key":"CR4","volume-title":"\u201cThe ellipsoid method: a survey\u201d, Technical Report No. 476","author":"R.G. Bland","year":"1980","unstructured":"R.G. Bland, D. Goldfarb and M.J. Todd, \u201cThe ellipsoid method: a survey\u201d, Technical Report No. 476, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York (1980)."},{"issue":"4","key":"CR5","first-page":"1","volume":"2","author":"Yu. M. Ermolev","year":"1966","unstructured":"Yu. M. Ermolev, \u201cMethods of solution of nonlinear extremal problems\u201d,Kibernetika 2 (4) (1966) 1\u201317. [Translated in:Cybernetics 2 (4) (1966), 1\u201314.]","journal-title":"Kibernetika"},{"key":"CR6","unstructured":"R. Fletcher and M.J.D. Powell, \u201cOn the modification of LDLT factorizations\u201d, Harwell Report TP. 519 (1973)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120921","volume":"14","author":"P. Gacs","year":"1981","unstructured":"P. Gacs and L. Lovasz, \u201cKhachiyan's algorithm for linear programming\u201d,Mathematical Programming Study 14 (1981) 61\u201368.","journal-title":"Mathematical Programming Study"},{"key":"CR8","volume-title":"\u201cLeast squares computations by Givens transformations without square roots\u201d, Research Report CSRR-2062","author":"W.M. Gentleman","year":"1973","unstructured":"W.M. Gentleman, \u201cLeast squares computations by Givens transformations without square roots\u201d, Research Report CSRR-2062, University of Waterloo, (Waterloo, Ontario, 1973)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1090\/S0025-5718-1974-0343558-6","volume":"28","author":"P.E. Gill","year":"1974","unstructured":"P.E. Gill, G.H. Golub, W. Murray and M.A. Saunders, \u201cMethods for modifying matrix factorizations\u201d,Mathematics of Computation 28 (1974) 505\u2013535.","journal-title":"Mathematics of Computation"},{"key":"CR10","first-page":"1051","volume":"29","author":"P.E. Gill","year":"1975","unstructured":"P.E. Gill, W. Murray and M.A. Saunders, \u201cMethods for computing and modifying the LDV factors of a matrix\u201d,Mathematics of Computation 29 (1975) 1051\u20131077.","journal-title":"Mathematics of Computation"},{"key":"CR11","series-title":"Working Paper","volume-title":"Acceleration in the relaxation method for linear inequalities and subgradient optimization","author":"J.-L. Goffin","year":"1979","unstructured":"J.-L. Goffin, \u201cAcceleration in the relaxation method for linear inequalities and subgradient optimization\u201d, Working Paper 79-10, Faculty of Management, McGill University, Montreal, (Montreal, 1979)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1137\/0117067","volume":"17","author":"D. Goldfarb","year":"1969","unstructured":"D. Goldfarb, \u201cExtension of Davidon's variable metric method to maximization under linear inequality and equality constraints\u201d,SIAM Journal on Applied Mathematics 17 (1969) 739\u2013764.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A.J. Hoffman","year":"1952","unstructured":"A.J. Hoffman, \u201cOn approximate solutions of systems of linear inequalities\u201d,Journal of Research of the National Bureau of Standards 49 (1952) 263\u2013265.","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"5","key":"CR14","first-page":"1093","volume":"244","author":"L.G. Khachian","year":"1979","unstructured":"L.G. Khachian, \u201cA polynomial algorithm in linear programming\u201d,Doklady Akademiia Nauk SSSR 244 (5) (1979) 1093\u20131096. [Translated in:Soviet Mathematics Doklady 20 (1) (1979) 191\u2013194.]","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"CR15","first-page":"159","volume-title":"Inequalities III","author":"V. Klee","year":"1972","unstructured":"V. Klee and G.L. Minty, \u201cHow good is the simplex algorithm?\u201d in: O. Shisha, ed.,Inequalities III (Academic Press, New York, 1972) pp. 159\u2013175."},{"key":"CR16","unstructured":"A. Yu. Levin, \u201cAn algorithm for the minimization of convex functions\u201d,Doklady Akademiia Nauk SSSR 160 (1955)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"T. Motzkin","year":"1954","unstructured":"T. Motzkin and I.J. Schoenberg, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 393\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/321281.321291","volume":"12","author":"D.J. Newman","year":"1965","unstructured":"D.J. Newman, \u201cLocation of the maximum on unimodal surfaces\u201d,Journal of the Association for Computing Machinery 12 (1965) 395\u2013398.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR19","first-page":"33","volume":"174","author":"B.T. Polyak","year":"1967","unstructured":"B.T. Polyak, \u201cA general method for solving extremum problems\u201d,Doklady Akademiia Nauk SSSR 174 (1967) 33\u201336. [Translated in:Soviet Mathematics Doklady 8 (1967) 593\u2013597.]","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"CR20","first-page":"509","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"B.T. Polyak, \u201cMinimization of unsmooth functionals\u201d,Zurnal Vychisditel' noi Matematiki i Matematicheskoi Fiziki 9 (1969) 509\u2013521. [Translated in:USSR Computational Mathematics and Mathematical Physics 9 (1969) 14\u201329.]","journal-title":"Zurnal Vychisditel' noi Matematiki i Matematicheskoi Fiziki"},{"key":"CR21","volume-title":"Nonsmooth optimization, IIASA proceedings volume 3","author":"B.T. Polyak","year":"1978","unstructured":"B.T. Polyak, \u201cSubgradient methods: a survey of Soviet research\u201d, in: C. Lemarechal and R. Mifflin, eds.,Nonsmooth optimization, IIASA proceedings volume 3 (Pergamon Press, Oxford, 1978)."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0108011","volume":"8","author":"J.B. Rosen","year":"1960","unstructured":"J.B. Rosen, \u201cThe gradient projection method for nonlinear programming, Part I, Linear constraints\u201d,Journal of the Society for Industrial and Applied Mathematics 8 (1960) 181\u2013217.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"CR23","volume-title":"On the structure of algorithms for the numerical solution of optimal planning and design problems","author":"N.Z. Shor","year":"1964","unstructured":"N.Z. Shor, \u201cOn the structure of algorithms for the numerical solution of optimal planning and design problems\u201d, Dissertation, Cybernetics Institute, Academy of Sciences of the Ukrainian SSR (Kiev, 1964)."},{"issue":"3","key":"CR24","first-page":"98","volume":"4","author":"N.Z. Shor","year":"1968","unstructured":"N.Z. Shor, \u201cThe rate of convergence of the generalized gradient descent method\u201d,Kibernetika 4 (3) (1968) 98\u201399. [Translated in:Cybernetics 4 (3) (1968) 79\u201380.]","journal-title":"Kibernetika"},{"issue":"1","key":"CR25","first-page":"6","volume":"6","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cUtilization of the operation of space dilatation in the minimization of convex functions\u201d,Kibernetika 6 (1) (1970) 6\u201312. [Translated in:Cybernetics 6 (1) (1970) 7\u201315.]","journal-title":"Kibernetika"},{"issue":"2","key":"CR26","first-page":"80","volume":"6","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cConvergence rate of the gradient descent method with dilatation of the space\u201d,Kibernetika 6 (2) (1970) 80\u201385. [Translated in:Cybernetics 6 (2) (1970) 102\u2013108.]","journal-title":"Kibernetika"},{"issue":"1","key":"CR27","first-page":"94","volume":"13","author":"N.Z. Shor","year":"1977","unstructured":"N.Z. Shor, \u201cCut-off method with space extension in convex programming problems\u201d,Kibernetika 13 (1) (1977) 94\u201395. [Translated in:Cybernetics 13 (1) (1977) 94\u201396.]","journal-title":"Kibernetika"},{"key":"CR28","volume-title":"\u201cSome remarks on the relaxation method for linear inequalities\u201d, Technical Report 419","author":"M.J. Todd","year":"1979","unstructured":"M.J. Todd, \u201cSome remarks on the relaxation method for linear inequalities\u201d, Technical Report 419, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York (1979)."},{"key":"CR29","volume-title":"Matrix iterative analysis","author":"R.S. Varga","year":"1962","unstructured":"R.S. Varga,Matrix iterative analysis (Prentice Hall, Englewood Cliffs, NJ, 1962)."},{"key":"CR30","volume-title":"The algebraic eigenvalue problem","author":"J.H. Wilkinson","year":"1965","unstructured":"J.H. Wilkinson,The algebraic eigenvalue problem (Oxford University Press, London, 1965)."},{"key":"CR31","first-page":"128","volume":"12","author":"D.B. Yudin","year":"1976","unstructured":"D.B. Yudin and A.S. Nemirovskii, \u201cA bound on the informational complexity of mathematical programming problems\u201d,Ekonomika i Matematicheskie Metody 12 (1976) 128\u2013142. [Translated in:Matekon (Winter 1976\u201377) (M.E. Sharpe, Inc., White Plains, N.Y.).]","journal-title":"Ekonomika i Matematicheskie Metody"},{"key":"CR32","first-page":"357","volume":"12","author":"D.B. Yudin","year":"1976","unstructured":"D.B. Yudin and A.S. Nemirovskii, \u201cInformational complexity and effective methods of solution for convex extremal problems\u201d,Ekonomika i Matematicheskie Metody 12 (1976) 357\u2013369. [Translated in:Matekon (Spring 1977) (M.E. Sharpe, Inc., White Plains, N.Y.).]","journal-title":"Ekonomika i Matematicheskie Metody"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583776.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01583776\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:24Z","timestamp":1556897364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01583776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01583776"],"URL":"https:\/\/doi.org\/10.1007\/bf01583776","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}