{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:53:41Z","timestamp":1648878821576},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":[[1993,2]]},"DOI":"10.1007\/bf01188712","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:39:58Z","timestamp":1108679998000},"page":"184-197","source":"Crossref","is-referenced-by-count":7,"title":["On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise"],"prefix":"10.1007","volume":"9","author":[{"given":"Robert A.","family":"Bosch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt M.","family":"Anstreicher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01580868","volume":"47","author":"K. M. Anstreicher","year":"1990","unstructured":"K. M. Anstreicher, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm,Mathematical Programming,47 (1990), 337?351.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01586053","volume":"54","author":"K. M. Anstreicher","year":"1992","unstructured":"K. M. Anstreicher and R. A. Bosch, Long steps in anO(n 3 L) algorithm for linear programming,Mathematical Programming,54 (1992), 251?265.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0802006","volume":"2","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, C. Roos, and J.-Ph. Vial, A complexity reduction for the long-step path-following algorithm for linear programming,SIAM Journal on Optimization,2 (1992), 71?87.","journal-title":"SIAM Journal on Optimization"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01586933","volume":"51","author":"R. M. Freund","year":"1991","unstructured":"R. M. Freund, Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,Mathematical Programming,51 (1991), 203?222.","journal-title":"Mathematical Programming"},{"key":"CR5","first-page":"1","volume-title":"Progress in Mathematical Programming","author":"C. C. Gonzaga","year":"1989","unstructured":"C. C. Gonzaga, An algorithm for solving linear programming problems inO(n 3 L) operations, inProgress in Mathematical Programming (N. Megiddo, ed.), Springer-Verlag, Berlin, 1989, pp. 1?28."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0801018","volume":"1","author":"C. C. Gonzaga","year":"1991","unstructured":"C. C. Gonzaga, Large-step path-following methods for linear programming. Part I: Barrier function method,SIAM Journal on Optimization,1 (1991), 268?279.","journal-title":"SIAM Journal on Optimization"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0802017","volume":"2","author":"C. C. Gonzaga","year":"1992","unstructured":"C. C. Gonzaga and M. J. Todd, AnO(?nL)-iteration large-step primal-dual affine algorithm for linear programming,SIAM Journal on Optimization,2 (1992), 349?359.","journal-title":"SIAM Journal on Optimization"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica,4 (1984), 373?395.","journal-title":"Combinatorica"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno, and A. Yoshise, A primal-dual interior point algorithm for linear programming, inProgress in Mathematical Programming (N. Megiddo, ed.), Springer-Verlag, Berlin, 1989a, pp. 29?47."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, S. Mizuno, and A. Yoshise, AnO(?nL) iteration potential reduction algorithm for linear complementarity problems,Mathematical Programming,50 (1991), 331?342.","journal-title":"Mathematical Programming"},{"key":"CR11","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, A polynomial-time algorithm for a class of linear complementarity problems,Mathematical Programming,44 (1989b), 1?26.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","volume":"1","author":"K. A. McShane","year":"1989","unstructured":"K. A. McShane, C. L. Monma, and D. F. Shanno, An implementation of a primal-dual interior point method for linear programming,ORSA Journal on Computing,1 (1989), 70?83.","journal-title":"ORSA Journal on Computing"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, Pathways to the optimal set in linear programming, inProgress in Mathematical Programming (N. Megiddo, ed.), Springer-Verlag, Berlin, 1989, pp. 131?158."},{"key":"CR14","volume-title":"Technical Report 22","author":"S. Mizuno","year":"1989","unstructured":"S. Mizuno,O(npL) iterationO(n 3 L) potential reduction algorithms for linear programming, Technical Report 22, Department of Management Science and Engineering, Tokyo Institute of Technology, Tokyo, 1989."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/BF01582906","volume":"52","author":"S. Mizuno","year":"1991","unstructured":"S. Mizuno and M. J. Todd, AnOn 3 L Adaptive path following algorithm for a linear complementarity problem,Mathematical Programming,52 (1991), 587?595.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R. C. Monteiro","year":"1989","unstructured":"R. C. Monteiro and I. Adler, Interior path following primal-dual algorithms. Part I: linear programming,Mathematical Programming,44 (1989a), 27?41.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R. C. Monteiro","year":"1989","unstructured":"R. C. Monteiro and I. Adler, Interior path following primal-dual algorithms. Part II: convex quadratic programming,Mathematical Programming,44 (1989b), 43?66.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, A polynomial-time algorithm, based on Newton's method, for linear programming,Mathematical Programming,40 (1988), 59?93.","journal-title":"Mathematical Programming"},{"key":"CR19","first-page":"433","volume-title":"Economic Decision Making: Games, Economics, and Optimization","author":"C. Roos","year":"1990","unstructured":"C. Roos and J. -P. Vial, Long steps with the logarithmic penalty barrier function in linear programming, inEconomic Decision Making: Games, Economics, and Optimization (H. Dr\u00e8ze, J. Gabszevwicz, J.-F. Richard, and L. Wolsey, eds.), Elsevier Science, Amsterdam, 1990, pp. 433?441."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01580753","volume":"41","author":"D. F. Shanno","year":"1988","unstructured":"D. F. Shanno, Computing Karmarkar projections quickly,Mathematical Programming,41 (1988), 61?71.","journal-title":"Mathematical Programming"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"P. M. Vaidya, An algorithm for linear programming which requiresO(((m+n)n2+(m+n)1.5n)L) arithmetic operations,Proceedings of the 19th ACM Symposium on the Theory of Computing, 1987, pp. 29?38.","DOI":"10.1145\/28395.28399"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye An","year":"1991","unstructured":"Y. Ye, AnO(n3L)potential reduction algorithm for linear programming,Mathematical Programming,50 (1991), 239?258.","journal-title":"Mathematical Programming"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188712.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188712\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:40:23Z","timestamp":1586119223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01188712"],"URL":"https:\/\/doi.org\/10.1007\/bf01188712","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}