{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T17:29:36Z","timestamp":1776965376151,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":[[1989,5]]},"DOI":"10.1007\/bf01587075","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:09:28Z","timestamp":1114664968000},"page":"27-41","source":"Crossref","is-referenced-by-count":363,"title":["Interior path following primal-dual algorithms. part I: Linear programming"],"prefix":"10.1007","volume":"44","author":[{"given":"Renato D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilan","family":"Adler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The nonlinear geometry of linear programming","author":"D.A. Bayer","year":"1986","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming,\u201d manuscripts, AT&T Bell Laboratories (Murray Hill, NJ, 1986), to appear inTransactions of the American Mathematical Society."},{"key":"CR2","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A. Fiacco","year":"1968","unstructured":"A. Fiacco and G. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (John Wiley and Sons, New York, 1968)."},{"key":"CR3","volume-title":"The logarithmic potential method of convex programming","author":"K.R. Frisch","year":"1955","unstructured":"K.R. Frisch, \u201cThe logarithmic potential method of convex programming,\u201d unpublished manuscript, University Institute of Economics (Oslo, Norway, 1955)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"CR5","volume-title":"\u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d Memorandum Number UCB\/ERL M87\/10","author":"C.C. Gonzaga","year":"1987","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d Memorandum Number UCB\/ERL M87\/10, Electronics Research Laboratory, Universtiy of California (Berkeley, CA, March, 1987)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR7","unstructured":"N. Karmarkar, Talk at the University of California at Berkeley (Berkeley, CA, 1984)."},{"key":"CR8","volume-title":"\u201cA primal-dual interior point algorithm for linear programming,\u201d Report No. B-188","author":"M. Kojima","year":"1987","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal-dual interior point algorithm for linear programming,\u201d Report No. B-188, Department of Information Sciences, Tokyo Institute of Technology (Tokyo, Japan, February, 1987)."},{"key":"CR9","volume-title":"\u201cPathways to the optimal set in linear programming,\u201d Research Report","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d Research Report, IBM Almaden Research Center (San Jose, CA, 1986)."},{"key":"CR10","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.R. Papadimitriou","year":"1982","unstructured":"C.R. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, New Jersey, 1982)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm based on Newton's method for linear programming,\u201dMathematical Programming 40 (1988) 59\u201393.","journal-title":"Mathematical Programming"},{"key":"CR12","volume-title":"An algorithm for linear programming which requires O(((m + n)n 2+(m + n) 1.5 n)L) arithmetic operations","author":"P.M. Vaidya","year":"1987","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O(((m + n)n 2+(m + n) 1.5 n)L) arithmetic operations,\u201d preprint, AT&T Bell Laboratories (Murray Hill, NJ, 1987)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01587075\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:31:37Z","timestamp":1556883097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01587075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["BF01587075"],"URL":"https:\/\/doi.org\/10.1007\/bf01587075","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}