{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:15Z","timestamp":1751367975348},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993,1]]},"DOI":"10.1007\/bf01581269","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:48:26Z","timestamp":1114681706000},"page":"243-255","source":"Crossref","is-referenced-by-count":8,"title":["Near boundary behavior of primal\u2014dual potential reduction algorithms for linear programming"],"prefix":"10.1007","volume":"58","author":[{"given":"Y.","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. O.","family":"Kortanek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Kaliski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","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, \u201cLong steps in an O(n 3 L) algorithm for linear programming,\u201dMathematical Programming 54 (1992) 251\u2013265.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01586933","volume":"51","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cPolynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,\u201dMathematical Programming 51 (1991) 203\u2013222.","journal-title":"Mathematical Programming"},{"key":"CR3","first-page":"1","volume-title":"Progress in Mathematical Programming-Interior Point and Related Methods","author":"C.C. Gonzaga","year":"1989","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming-Interior Point and Related Methods (Springer, New York, 1989) pp. 1\u201328."},{"key":"CR4","unstructured":"C.C. Gonzaga and M.J. Todd, \u201cAn O( $$\\sqrt n $$ L)-iteration large-step primal\u2014dual affine algorithm for linear programming,\u201d to appear inSIAM Journal on Optimization."},{"key":"CR5","first-page":"92","volume-title":"Large-Scale Numerical Optimization","author":"C.-G. Han","year":"1990","unstructured":"C.-G. Han, P.M. Pardalos and Y. Ye, \u201cComputational aspects of an interior point algorithm for quadratic programming problems with box constraints,\u201d in: T.F. Coleman and Y. Li, eds.,Large-Scale Numerical Optimization (SIAM, Philadelphia, PA, 1990) pp. 92\u2013112."},{"key":"CR6","unstructured":"S. Huang and K.O. Kortanek, \u201cA simultaneous primal\u2014dual potential reduction algorithm for linear programming,\u201d to appear inOperations Research Letters."},{"key":"CR7","series-title":"Working Paper Series","volume-title":"A hybrid polynomial algorithm for linear programming","author":"S. Huang","year":"1989","unstructured":"S. Huang and K.O. Kortanek, \u201cA hybrid polynomial algorithm for linear programming,\u201d Working Paper Series 89-25, Department of Management Sciences, The University of Iowa (Iowa City, IA, 1989)."},{"key":"CR8","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":"CR9","doi-asserted-by":"crossref","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise, \u201cA unified approach to interior point algorithms for linear complementarity problems,\u201d Presentation at theSecond Asilomar Workshop on Progress in Mathematical Programming (Asilomar, CA, 1990).","DOI":"10.1016\/0167-6377(91)90010-M"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01586054","volume":"54","author":"M. Kojima","year":"1992","unstructured":"M. Kojima, N. Megiddo and Y. Ye, \u201cAn interior point potential reduction algorithm for the linear complementarity problem,\u201dMathematical Programming 54 (1992) 267\u2013279.","journal-title":"Mathematical Programming"},{"key":"CR11","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, \u201cAn O( $$\\sqrt n $$ L) iteration potential reduction algorithm for linear complementarity problems,\u201dMathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"CR12","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 complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR13","first-page":"29","volume-title":"Progress in Mathematical Programming \u2014 Interior Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal\u2014dual interior point method for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming \u2014 Interior Point and Related Methods (Springer, New York, 1989) pp. 29\u201347."},{"key":"CR14","volume-title":"Interior point potential function reduction algorithms for solving convex quadratic programs","author":"S. Liu","year":"1989","unstructured":"S. Liu and D. Goldfarb, \u201cInterior point potential function reduction algorithms for solving convex quadratic programs,\u201d manuscript, Department of IEOR, Columbia University (New York, NY, 1989)."},{"key":"CR15","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, \u201cAn implementation of a primal\u2014dual interior point method for linear programming,\u201dORSA JOurnal on Computing 1 (1989) 70\u201383.","journal-title":"ORSA JOurnal on Computing"},{"key":"CR16","first-page":"131","volume-title":"Progress in Mathematical Programming \u2014 Interior Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming \u2014 Interior Point and Related Methods (Springer, New York, 1989) pp. 131\u2013158."},{"key":"CR17","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, \u201cAn O(n 3 L) primal\u2014dual interior point algorithm for linear programming,\u201dMathematical Programming 44 (1989) 27\u201342.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R.C. Monteiro","year":"1990","unstructured":"R.C. Monteiro, I. Adler and M.C. Resende, \u201cA plynomial-time primal\u2014dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,\u201dMathematics of Operations Research 15 (1990) 191\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"CR19","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":"CR20","first-page":"118","volume-title":"New Methods for Linear Programming","author":"K. Tanabe","year":"1987","unstructured":"K. Tanabe, \u201cComplementary-enforcing centered Newton method for mathematical programming,\u201d in: K. Tone, ed.,New Methods for Linear Programming (The Institute of Statistical Mathematics, Tokyo, 1987) pp. 118\u2013144."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd and Y. Ye, \u201cA centered projective algorithm for linear programming,\u201dMathematics of Operations Research 15 (1990) 508\u2013529.","journal-title":"Mathematics of Operations Research"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cAn O(n 3 L) potential reduction algorithm for linear programming,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"},{"key":"CR23","unstructured":"Y. Ye, \u201cLine search in potential reduction algorithms for linear programming,\u201d manuscript (1989)."},{"key":"CR24","series-title":"Working Paper Series","volume-title":"Bimatrix equilibrium points and potential functions, linear programming","author":"Y. Ye","year":"1988","unstructured":"Y. Ye, \u201cBimatrix equilibrium points and potential functions, linear programming,\u201d Working Paper Series 88-16, Department of Management Sciences, The University of Iowa (Iowa City, IA, 1988)."},{"key":"CR25","volume-title":"\u201cOn the superlinear and quadratic convergence of primal\u2014dual interior point linear programming algorithms,\u201d TR90-6","author":"Y. Zhang","year":"1990","unstructured":"Y. Zhang, R.A. Tapia and J.E. Dennis, \u201cOn the superlinear and quadratic convergence of primal\u2014dual interior point linear programming algorithms,\u201d TR90-6, Department of Mathematical Sciences, Rice University (Houston, TX, 1990)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581269.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581269\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:56:00Z","timestamp":1586231760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["BF01581269"],"URL":"https:\/\/doi.org\/10.1007\/bf01581269","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}