{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T06:02:09Z","timestamp":1787378529565,"version":"3.56.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf02206811","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T04:32:15Z","timestamp":1128573135000},"page":"59-80","source":"Crossref","is-referenced-by-count":2,"title":["An infeasible-interior-point algorithm using projections onto a convex set"],"prefix":"10.1007","volume":"62","author":[{"given":"Shinji","family":"Mizuno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Jarre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02206811_CR1","volume-title":"An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution","author":"R. Freund","year":"1993","unstructured":"R. Freund, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, Working Paper 3559-93-MSA, Sloan School of Management, Massachusetts Institute of Technology, USA (1993)."},{"key":"BF02206811_CR2","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\u2013395.","journal-title":"Combinatorica"},{"key":"BF02206811_CR3","volume-title":"Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, Research Report B-268, Department of Information Sciences, Tokyo Institute of Technology, Japan (1993)."},{"key":"BF02206811_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, A primal-dual infeasible-interior-point algorithm for linear programming, Mathematical Programming 61(1993)261\u2013280.","journal-title":"Mathematical Programming"},{"key":"BF02206811_CR5","first-page":"29","volume-title":"Progress in Mathematical Programming, Interior-Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, A primal-dual interior point algorithm for linear programming, in:Progress in Mathematical Programming, Interior-Point and Related Methods, ed. N. Megiddo (Springer, New York, 1989) pp. 29\u201347."},{"key":"BF02206811_CR6","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 complementary problems, Mathematical Programming 44(1989)1\u201326.","journal-title":"Mathematical Programming"},{"key":"BF02206811_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01581253","volume":"59","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, A little theorem of the bigM in interior point methods, Mathematical Programming 59(1993)361\u2013375.","journal-title":"Mathematical Programming"},{"key":"BF02206811_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I.J. Lustig","year":"1990\/91","unstructured":"I.J. Lustig, Feasibility issues in a primal-dual interior-point method for linear programming, Mathematical Programming 49(1990\/91)145\u2013162.","journal-title":"Mathematical Programming"},{"key":"BF02206811_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra and Its Applications 152(1991)191\u2013222.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02206811_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1287\/inte.20.4.105","volume":"20","author":"R. Marsten","year":"1990","unstructured":"R. Marsten, R. Subramanian, M. Saltzman, I.J. Lustig and D. Shanno, Interior point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick!, Interfaces 20 (1990)105\u2013116.","journal-title":"Interfaces"},{"key":"BF02206811_CR11","first-page":"131","volume-title":"Progress in Mathematical Programming, Interior-Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, Pathways to the optimal set in linear programming, in:Progress in Mathematical Programming, Interior-Point and Related Methods, ed. N. Megiddo (Springer, New York, 1989) pp. 131\u2013158."},{"key":"BF02206811_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S. Mizuno","year":"1994","unstructured":"S. Mizuno, Polynomiality of infeasible-interior-point algorithms for linear programming, Mathematical Programming 67(1994)109\u2013119.","journal-title":"Mathematical Programming"},{"key":"BF02206811_CR13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0805003","volume":"5","author":"S. Mizuno","year":"1995","unstructured":"S. Mizuno, M. Kojima, and M.J. Todd Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming, SIAM Journal on Optimization 5(1995)52\u201367.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02206811_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/moor.20.1.135","volume":"20","author":"S. Mizuno","year":"1995","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, A surface of analytic centers and primal-dual infeasible-interior-point algorithms for linear programming, Mathematics of Operations Research 20(1995) 135\u2013162.","journal-title":"Mathematics of Operations Research"},{"key":"BF02206811_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, Interior path following primal-dual algorithms. Part I: Linear programming, Mathematical Programming 44(1989)27\u201341.","journal-title":"Mathematical Programming"},{"key":"BF02206811_CR16","volume-title":"An infeasible interior-point predictor-corrector algorithm for linear programming","author":"F.A. Potra","year":"1992","unstructured":"F.A. Potra, An infeasible interior-point predictor-corrector algorithm for linear programming, Report No. 26, Department of Mathematics, The University of Iowa, USA (1992)."},{"key":"BF02206811_CR17","volume-title":"A quadratically convergent infeasible interior-point algorithm for linear programming","author":"F.A. Potra","year":"1992","unstructured":"F.A. Potra, A quadratically convergent infeasible interior-point algorithm for linear programming, Report No. 28, Department of Mathematics, The University of Iowa, USA (1992)."},{"key":"BF02206811_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556789408805552","volume":"3","author":"J. Stoer","year":"1994","unstructured":"J. Stoer, The complexity of an infeasible interior-point path-following method for the solution of linear programs, Optimization Methods and Software 3(1994)1\u201312.","journal-title":"Optimization Methods and Software"},{"key":"BF02206811_CR19","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0042787","volume-title":"System Modeling and Optimization","author":"K. Tanabe","year":"1988","unstructured":"K. Tanabe, Centered Newton method for mathematical programming, in:System Modeling and Optimization, eds. M. Iri and K. Yajima (Springer, New York, 1988) pp. 197\u2013206."},{"key":"BF02206811_CR20","first-page":"98","volume-title":"New Methods for Linear Programming 3","author":"K. Tanabe","year":"1990","unstructured":"K. Tanabe, Centered Newton method for linear programming: Interior and \u201cexterior\u201d point method (in Japanese), in:New Methods for Linear Programming 3, ed. K. Tone (The Institute of Statistical Mathematics, Tokyo, Japan, 1990) pp. 98\u2013100."},{"key":"BF02206811_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y. Ye","year":"1994","unstructured":"Y. Ye, M.J. Todd and S. Mizuno, An $$O(\\sqrt {nL} )$$ -iteration homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research 19(1994)53\u201367.","journal-title":"Mathematics of Operations Research"},{"key":"BF02206811_CR22","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang, On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem, SIAM Journal on Optimization 4 (1994)208\u2013227.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02206811_CR23","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01581155","volume":"66","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang and D. Zhang, Superlinear convergence of infeasible interior-point methods for linear programming, Mathematical Programming 66(1994)361\u2013378.","journal-title":"Mathematical Programming"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206811.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02206811\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T18:35:27Z","timestamp":1557858927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02206811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF02206811"],"URL":"https:\/\/doi.org\/10.1007\/bf02206811","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}