{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T07:26:40Z","timestamp":1751614000190},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf01840461","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T21:29:13Z","timestamp":1121290153000},"page":"529-535","source":"Crossref","is-referenced-by-count":29,"title":["Homotopy techniques in linear programming"],"prefix":"10.1007","volume":"1","author":[{"given":"J. L.","family":"Nazareth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840461_CR1","volume-title":"Linear Programming and Extensions","author":"G. B. Dantzig","year":"1963","unstructured":"G. B. Dantzig,Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963."},{"key":"BF01840461_CR2","first-page":"153","volume-title":"Constructive Approaches to Mathematical Models","author":"B. C. Eaves","year":"1979","unstructured":"B. C. Eaves, A view of complementary pivot theory (or solving equations with homotopies), inConstructive Approaches to Mathematical Models (C. V. Coffman and G. J. Fix, eds.), Academic Press, New York, 1979, pp. 153\u2013170."},{"key":"BF01840461_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.1.1.1","volume":"1","author":"B. C. Eaves","year":"1976","unstructured":"B. C. Eaves and H. Scarf, The solution of systems of piecewise-linear equations,Math. Oper. Res.,1 (1976), 1\u201327.","journal-title":"Math. Oper. Res."},{"key":"BF01840461_CR4","volume-title":"Pathways to Solutions, Fixed Points and Equilibria","author":"C. B. Garcia","year":"1981","unstructured":"C. B. Garcia and W. I. Zangwill,Pathways to Solutions, Fixed Points and Equilibria, Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"key":"BF01840461_CR5","series-title":"Technical Report SOL","doi-asserted-by":"crossref","DOI":"10.21236\/ADA158212","volume-title":"On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method","author":"P. E. Gill","year":"1985","unstructured":"P. E. Gill, W. Murray, M. A. Saunders, J. A. Tomlin, and M. H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Technical Report SOL 85-11, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA, 1985."},{"key":"BF01840461_CR6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/cpa.3160320302","volume":"32","author":"M. Hirsch","year":"1979","unstructured":"M. Hirsch and S. Smale, On algorithms for solvingf(x) = 0,Comm. Pure Appl. Math.,32 (1979), 281\u2013312.","journal-title":"Comm. Pure Appl. Math."},{"key":"BF01840461_CR7","doi-asserted-by":"crossref","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming,Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 302\u2013311.","DOI":"10.1145\/800057.808695"},{"key":"BF01840461_CR8","first-page":"1093","volume":"244","author":"L. G. Khachiyan","year":"1979","unstructured":"L. G. Khachiyan, A polynomial algorithm for linear programming,Dokl. Akad. Nauk SSSR,244 (1979), 1093\u20131096 (translated inSoviet Math. Dokl,20 (1979), 191\u2013194).","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"BF01840461_CR9","volume-title":"Mathematics of the Decision Sciences","author":"C. E. Lemke","year":"1968","unstructured":"C. E. Lemke, On complementary pivot theory, inMathematics of the Decision Sciences (G. B. Dantzig and A. F. Veinott, eds.), American Mathematical Society, Providence, RI, 1968."},{"key":"BF01840461_CR10","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0718039","volume":"18","author":"O. L. Mangasarian","year":"1981","unstructured":"O. L. Mangasarian, Iterative solution of linear programs,SIAM J. Numer. Anal,18 (1981), 606\u2013614.","journal-title":"SIAM J. Numer. Anal"},{"key":"BF01840461_CR11","series-title":"Preliminary Report","volume-title":"A variation on Karmarkar's algorithm","author":"N. Megiddo","year":"1985","unstructured":"N. Megiddo, A variation on Karmarkar's algorithm, Preliminary Report, IBM Research Laboratory, San Jose, CA, 1985."},{"key":"BF01840461_CR12","volume-title":"Numerical Methods in Extremum Problems","author":"B. N. Pschenichny","year":"1975","unstructured":"B. N. Pschenichny and Y. M. Danilin,Numerical Methods in Extremum Problems, M.I.R., Moscow, 1975 (English translation, 1978)."},{"key":"BF01840461_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R. T. Rockafellar","year":"1976","unstructured":"R. T. Rockafellar, Augmented lagrangians and applications of the proximal point algorithm in convex programming,Math. Oper. Res.,1 (1976), 97\u2013116.","journal-title":"Math. Oper. Res."},{"key":"BF01840461_CR14","series-title":"Working Paper","volume-title":"A reduced gradient variant of Karmarkar's algorithm","author":"D. F. Shanno","year":"1985","unstructured":"D. F. Shanno, A reduced gradient variant of Karmarkar's algorithm, Working Paper 85-01, Graduate School of Administration, University of California, Davis, CA, 1985."},{"key":"BF01840461_CR15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/978-3-642-68874-4_19","volume-title":"Mathematical Programming: The State of the Art","author":"N. Z. Shor","year":"1983","unstructured":"N. Z. Shor, Generalized gradient methods of non-differentiable optimization employing space dilation operations, inMathematical Programming: The State of the Art (A. Bachem, M. Grotschel, and B. Korte, eds.), Springer-Verlag, Berlin, 1983, pp. 501\u2013529."},{"key":"BF01840461_CR16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-4068(76)90019-7","volume":"3","author":"S. Smale","year":"1976","unstructured":"S. Smale, A convergent process of price adjustment and global Newton methods,J. Math. Econom.,3 (1976), 107\u2013120.","journal-title":"J. Math. Econom."},{"key":"BF01840461_CR17","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/978-3-642-68874-4_20","volume-title":"Mathematical Programming: The State of the Art","author":"S. Smale","year":"1983","unstructured":"S. Smale, The problem of the average speed of the simplex method, inMathematical Programming: The State of the Art (A. Bachem, M. Grotschel, and B. Korte, eds.), Springer-Verlag, Berlin, 1983, pp. 530\u2013539."},{"key":"BF01840461_CR18","first-page":"13","volume":"18","author":"G. Strang","year":"1985","unstructured":"G. Strang, Karmarkar's algorithm in a nutshell,SIAM News,18 (1985), 13.","journal-title":"SIAM News"},{"key":"BF01840461_CR19","series-title":"Technical Report","volume-title":"An extension of Karmarkar's algorithm for linear programming using dual variables","author":"M. J. Todd","year":"1985","unstructured":"M. J. Todd and B. P. Burrell, An extension of Karmarkar's algorithm for linear programming using dual variables, Technical Report 648, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1985."},{"key":"BF01840461_CR20","volume-title":"An experimental approach to Karmarkar's linear programming algorithm, Preprint","author":"J. A. Tomlin","year":"1985","unstructured":"J. A. Tomlin, An experimental approach to Karmarkar's linear programming algorithm, Preprint, Ketron Inc., Mountain View, CA, 1985."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840461.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840461\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T19:35:32Z","timestamp":1557430532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":20,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF01840461"],"URL":"https:\/\/doi.org\/10.1007\/bf01840461","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}