{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:26:26Z","timestamp":1751880386085},"reference-count":15,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0167-6377(91)90068-z","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"501-507","source":"Crossref","is-referenced-by-count":3,"title":["A note on a potential reduction algorithm for LP with simultaneous primal-dual updating"],"prefix":"10.1016","volume":"10","author":[{"given":"S.","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.O.","family":"Kortanek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90068-Z_BIB1","series-title":"Long steps in a O(n3L) algorithm for linear programming","author":"Anstreicher","year":"1988"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB2","article-title":"Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function","author":"Freund","year":"1988"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB3","series-title":"SORIE Technical Report No. 862","article-title":"An O(\u221anL)-iteration large-step primal-dual affine algorithm for linear programming","author":"Gonzaga","year":"1989"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB5","unstructured":"M. Kojima, N. Megiddo, and T. Noma, \u201cHomotopy continuation methods for linear complementarity problems\u201d, Dept. of Information Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-Ka, Tokyo 152, Japan."},{"key":"10.1016\/0167-6377(91)90068-Z_BIB6","series-title":"An interior point potential reduction algorithm for the linear complementarity problem","author":"Kojima","year":"1988"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB7","series-title":"Progress in Mathematical Programming","first-page":"29","article-title":"A primal-dual interior point algorithm for linear programming","author":"Kojima","year":"1989"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","article-title":"A O(\u221anL) iteration potential reduction algorithm for linear complementary problems","volume":"50","author":"Kojima","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB9","article-title":"A simultaneous primal-dual potential reduction algorithm for linear programming","author":"Kortanek","year":"1989"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB10","series-title":"Proceedings of the 6th Mathematical Programming Symposium of Japan","first-page":"1","article-title":"Pathways to the optimal set in linear programming","author":"Megiddo","year":"1986"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","article-title":"An O(n3L) primal-dual interior point algorithm for linear programming","volume":"44","author":"Monteiro","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","article-title":"A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension","volume":"15","author":"Monteiro","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(91)90068-Z_BIB13","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","article-title":"A centered projective algorithm for linear programming","volume":"15","author":"Todd","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(91)90068-Z_BIB14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","article-title":"An O(n3L) potential reduction algorithm for linear programming","volume":"50","author":"Ye","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90068-Z_BIB15","unstructured":"Y. Ye, \u201cBimatrix equilibrium points and potential functions\u201d, July, 1988 Integrated Systems, Santa Clara, CA and The University of Iowa, Iowa City."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190068Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190068Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:27:41Z","timestamp":1552901261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779190068Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["016763779190068Z"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90068-z","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}