{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:57:40Z","timestamp":1648738660160},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1007\/bf01415890","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T12:25:07Z","timestamp":1112531107000},"page":"227-257","source":"Crossref","is-referenced-by-count":1,"title":["Insights into the interior-point methods"],"prefix":"10.1007","volume":"36","author":[{"given":"R. -L.","family":"Sheu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. -C.","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Working paper","author":"I Adler","year":"1986","unstructured":"Adler I, Karmarkar N, Resende MGC, Veiga G (1986) An Implementation of Karmarkar's Algorithm for Linear Programming. Working paper, Operations Research Center, University of California, Berkeley, California"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"ER Barnes","year":"1986","unstructured":"Barnes ER (1986) A Variation on Karmarkar's Algorithm for Solving Linear Programming Problems. Mathematical Programming 36:174?182","journal-title":"Mathematical Programming"},{"key":"CR3","unstructured":"Fang S-C (1990) A New Unconstrained Convex Programming Approach to Linear Programming. OR Report No 243, North Carolina State University"},{"key":"CR4","volume-title":"Numerical Methods for Constrained Optimization","author":"PE Gill","year":"1974","unstructured":"Gill PE, Murray W (1974) Numerical Methods for Constrained Optimization. Academic Press, London"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"PE Gill","year":"1986","unstructured":"Gill PE, Murray W, Saunders MA, Tomlin JA, Wright MH (1986) On Projected Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method. Mathematical Programming 36:183?209","journal-title":"Mathematical Programming"},{"key":"CR6","volume-title":"Memorandum # UCB\/ERLM87\/10","author":"C Gonzaga","year":"1987","unstructured":"Gonzaga C (1987) An Algorithm for Solving Linear Programming Problems inO(n 3L) Operations. Memorandum # UCB\/ERLM87\/10. Electronics Laboratory, College of Engineering, University of California, Berkeley"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A New Polynomial Time Algorithm for Linear Programming. Combinatorica 4:373?395","journal-title":"Combinatorica"},{"key":"CR8","volume-title":"Research Report B-188","author":"M Kojima","year":"1987","unstructured":"Kojima M, Mizuno S, Yoshise A (1987) A Primal-dual Interior Point Method for Linear Programming. Research Report B-188. Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan"},{"key":"CR9","volume-title":"IBM Research Report RJ 5295","author":"N Megiddo","year":"1986","unstructured":"Megiddo N (1986) Pathways to the Optimal Set of Linear Programming. IBM Research Report RJ 5295, IBM Almaden Research Center, San Jose, California"},{"key":"CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9617-8","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"N Megiddo","year":"1989","unstructured":"Megiddo N (1989) Progress in Mathematical Programming: Interior-Point and Related Methods. Springer, New York"},{"key":"CR11","volume-title":"AnO(n 3L) Primal-dual Interior Point Algorithm for Linear Programming. Manuscript","author":"RC Monteiro","year":"1987","unstructured":"Monteiro RC, Adler I (1987) AnO(n 3L) Primal-dual Interior Point Algorithm for Linear Programming. Manuscript, Department of IE & OR, University of California, Berkeley, California. To appear in Mathematical Programming"},{"key":"CR12","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"JL Nazareth","year":"1989","unstructured":"Nazareth JL (1989) Pricing Criteria in Linear Programming. In: Progress in Mathematical Programming: Interior-Point and Related Methods. Springer, New York"},{"key":"CR13","volume-title":"Fundamentals of Linear Algebra","author":"K Nomizu","year":"1966","unstructured":"Nomizu K (1966) Fundamentals of Linear Algebra. McGraw-Hill, New Jersey"},{"key":"CR14","unstructured":"Shanno DF, Bagchi A (1988) A Unified View of Interior Point Methods for Linear Programming. Rutcor Research Report # 35-88"},{"key":"CR15","volume-title":"Numerical Methods in Extremal Problems","author":"BN Pshenichny","year":"1978","unstructured":"Pshenichny BN, Danilin YM (1978) Numerical Methods in Extremal Problems. Mir Publishers, Moscow"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"RJ Vanderbei","year":"1986","unstructured":"Vanderbei RJ, Meketon MS, Freeman BA (1986) A Modification of Karmarkar's Linear Programming Algorithm. Algorithmica 1:395?407","journal-title":"Algorithmica"},{"key":"CR17","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"Y Ye","year":"1989","unstructured":"Ye Y (1989) An Extension of Karmarkar's Algorithm of the Trust Region Method for Quadratic Programming. In: Progress in Mathematical Programming: Interior-Point and Related Methods. Springer, New York"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415890.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01415890\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:12:36Z","timestamp":1556817156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01415890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["BF01415890"],"URL":"https:\/\/doi.org\/10.1007\/bf01415890","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}