{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:28:12Z","timestamp":1783099692261,"version":"3.54.6"},"reference-count":10,"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\/bf01587076","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:28Z","timestamp":1114679368000},"page":"43-66","source":"Crossref","is-referenced-by-count":240,"title":["Interior path following primal-dual algorithms. part II: Convex quadratic programming"],"prefix":"10.1007","volume":"44","author":[{"given":"Renato D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilan","family":"Adler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","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, University of California (Berkeley, CA, March, 1987)."},{"key":"CR2","first-page":"147","volume-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computing","author":"S. Kappor","year":"1986","unstructured":"S. Kappor and P.M. Vaidya, \u201cFast algorithms for convex quadratic programming and multicommodity flows,\u201d in:Proceedings of the 18th Annual ACM Symposium on Theory of Computing (Berkeley, California, May 1986) pp. 147\u2013159."},{"key":"CR3","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":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial-time algorithm for a class of linear complemtarity problems,\u201dMathematical Programming 44 (1989) 1\u201326, this issue.","journal-title":"Mathematical Programming"},{"key":"CR5","first-page":"1051","volume":"5","author":"M.K. Kozlov","year":"1979","unstructured":"M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, \u201cPolynomial solvability of convex quadratic programming,\u201dDoklady Akademiia Nauk SSSR 5 (1979) 1051\u20131053. [Translated in:Soviet Mathematics Doklady 20 (1979) 1108\u20131111.]","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"CR6","first-page":"95","volume-title":"Mathematics of the Decision Sciences, Part I","author":"C.E. Lemke","year":"1968","unstructured":"C.E. Lemke, \u201cOn complementary pivot theory,\u201d in: G.B. Dantzig and A.F. Vienott, eds.,Mathematics of the Decision Sciences, Part I (American Mathematical Society, Providence, RI, 1968) pp. 95\u2013114."},{"key":"CR7","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":"CR8","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":"CR9","volume-title":"\u201cAn 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)."},{"key":"CR10","series-title":"Working Paper","volume-title":"A polynomial algorithm for convex quadratic programming","author":"Y. Ye","year":"1986","unstructured":"Y. Ye and E. Tse, \u201cA polynomial algorithm for convex quadratic programming,\u201d Working Paper, Department of Engineering-Economic Systems, Stanford University (Stanford, CA, 1986)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01587076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:31:37Z","timestamp":1556897497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01587076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["BF01587076"],"URL":"https:\/\/doi.org\/10.1007\/bf01587076","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}