{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T08:51:23Z","timestamp":1684227083579},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":[[1994,2]]},"DOI":"10.1007\/bf01581689","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:42:27Z","timestamp":1114681347000},"page":"43-72","source":"Crossref","is-referenced-by-count":33,"title":["Global convergence in infeasible-interior-point algorithms"],"prefix":"10.1007","volume":"65","author":[{"given":"Masakazu","family":"Kojima","sequence":"first","affiliation":[]},{"given":"Toshihito","family":"Noma","sequence":"additional","affiliation":[]},{"given":"Akiko","family":"Yoshise","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/0112056","volume":"12","author":"R.W. Cottle","year":"1964","unstructured":"R.W. Cottle, \u201cNote on a fundamental theorem on quadratic programming,\u201dSIAM Journal on Applied Mathematics 12 (1964) 663\u2013665.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR2","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (John Wiley & Sons, New York, 1968)."},{"key":"CR3","volume-title":"\u201cThe logarithmic potential method of convex programming,\u201d Technical report","author":"K.R. Frish","year":"1955","unstructured":"K.R. Frish, \u201cThe logarithmic potential method of convex programming,\u201d Technical report, University Institute of Economics, Oslo, Norway, 1955."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/moor.18.1.128","volume":"18","author":"O. G\u00fcler","year":"1993","unstructured":"O. G\u00fcler, \u201cExistence of interior points and interior paths in nonlinear monotone complementarity problems,\u201dMathematics of Operations Research 18 (1993) 128\u2013147.","journal-title":"Mathematics of Operations Research"},{"key":"CR5","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":"CR6","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1287\/moor.18.4.945","volume":"18","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, \u201cA general framework of continuation methods for complementarity problems,\u201dMathematics of Operations Research 18 (1993) 945\u2013963.","journal-title":"Mathematics of Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, \u201cA primal-dual infeasible-interior-point algorithm for linear programming,\u201dMathematical Programming 61 (1993) 263\u2013280.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.16.4.754","volume":"16","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo and T. Noma, \u201cHomotopy continuation methods for nonlinear complementarity problems,\u201dMathematics of Operations Research 16 (1991) 754\u2013774.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science 538","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science 538 (Springer-Verlag, New York, 1991).","DOI":"10.1007\/3-540-54509-3"},{"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","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, \u201cA primal-dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior-Point and Related Methods (Springer-Verlag, New York, 1989) 29\u201347."},{"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 complementary problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR13","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 {nL} )$$ iteration potential reduction algorithm for linear complementarity problems,\u201dMathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"CR14","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, \u201cA little theorem of the big\u2133 in interior point algorithms,\u201dMathematical Programming, 59 (1993) 361\u2013375.","journal-title":"Mathematical Programming"},{"key":"CR15","series-title":"Working Paper Series","volume-title":"A polynomial algorithm for convex programming problems satisfying a scaled Lipschitz condition","author":"K.O. Kortanek","year":"1990","unstructured":"K.O. Kortanek and J. Zhu, \u201cA polynomial algorithm for convex programming problems satisfying a scaled Lipschitz condition,\u201d Working Paper Series No. 90-17, Dept. of Management Sciences, College of Business Administration, The University of Iowa, Iowa City, Iowa 52242, 1990."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I.J. Lustig","year":"1990\/91","unstructured":"I.J. Lustig, \u201cFeasibility issues in a primal-dual interior-point method for linear programming,\u201dMathematical Programming 49 (1990\/91) 145\u2013162.","journal-title":"Mathematical Programming"},{"key":"CR17","first-page":"251","volume-title":"Variational Inequalities and Complementarity Problems","author":"L. McLinden","year":"1980","unstructured":"L. McLinden, \u201cThe complementarity problem for maximal monotone multifunctions,\u201d in: R.W. Cottle, F. Giannessi and J.L. Lions, eds.,Variational Inequalities and Complementarity Problems (John Wiley & Sons, New York, 1980) 251\u2013270."},{"key":"CR18","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-dual interior point method for linear programming,\u201dORSA Journal on Computing 1 (1989) 70\u201383.","journal-title":"ORSA Journal on Computing"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01593775","volume":"12","author":"N. Megiddo","year":"1977","unstructured":"N. Megiddo, \u201cA monotone complementarity problem with feasible solutions but no complementary solutions,\u201dMathematical Programming 12 (1977) 131\u2013132.","journal-title":"Mathematical Programming"},{"key":"CR20","first-page":"131","volume-title":"Progress in Mathematical Programming, 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, Interior-Point and Related Methods, (Springer-Verlag, New York, 1989) 131\u2013158."},{"key":"CR21","volume-title":"\u201cPolynomiality of Kojima\u2014Megiddo\u2014Mizuno infeasible interior point algorithm for linear programming,\u201d Technical report","author":"S. Mizuno","year":"1992","unstructured":"S. Mizuno, \u201cPolynomiality of Kojima\u2014Megiddo\u2014Mizuno infeasible interior point algorithm for linear programming,\u201d Technical report, The Institute of Statistical Mathematics, Minami-Azabu, Minato-ku, Tokyo, 106, Japan, 1992."},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"S. Mizuno, M. Kojima and M.J. Todd, \u201cInfeasible-interior-point primal-dual potential-reduction algorithms for linear programming,\u201dSiam Journal on Optimization, to appear.","DOI":"10.1137\/0805003"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01585163","volume":"62","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno and A. Nagasawa, \u201cA primal-dual affine scaling potential reduction algorithm for linear programming,\u201dMathematical Programming 62 (1993) 119\u2013131.","journal-title":"Mathematical Programming"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, \u201cOn adaptive-step primal-dual interior-point algorithms for linear programming,\u201dMathematics of Operations Research 18 (1993) 964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR25","volume-title":"\u201cA surface of analytic centers and infeasible-interior-point algorithms for linear programming,\u201d Technical Report","author":"S. Mizuno","year":"1992","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, \u201cA surface of analytic centers and infeasible-interior-point algorithms for linear programming,\u201d Technical Report, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY 14853, December 1992)."},{"key":"CR26","volume-title":"\u201cA globally convergent primal-dual interior point algorithm for convex programming,\u201d Technical report","author":"R.D.C. Monteiro","year":"1991","unstructured":"R.D.C. Monteiro, \u201cA globally convergent primal-dual interior point algorithm for convex programming,\u201d Technical report, Systems and Industrial Engineering, University Arizona, Tucson, AZ 85721, 1991."},{"key":"CR27","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, \u201cInterior path following primal-dual algorithms. Part I: linear programming,\u201dMathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms. Part II: convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/moor.15.3.408","volume":"15","author":"R.D.C. Monteiro","year":"1990","unstructured":"R.D.C. Monteiro and I. Adler, \u201cAn extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence,\u201dMathematics of Operations Research 15 (1990) 408\u2013422.","journal-title":"Mathematics of Operations Research"},{"key":"CR30","volume-title":"\u201cA globally and superlinearly convergent potential reduction interior point method for convex programming,\u201d Technical report","author":"R.D.C. Monteiro","year":"1992","unstructured":"R.D.C. Monteiro and S.J. Wright, \u201cA globally and superlinearly convergent potential reduction interior point method for convex programming,\u201d Technical report, Systems and Industrial Engineering, University Arizona, Tucson, AZ 85721, 1992."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01580248","volume":"6","author":"J.J. More","year":"1974","unstructured":"J.J. More, Class of functions and feasibility conditions in nonlinear complementarity problem,Mathematical Programming 6 (1974) 327\u2013338.","journal-title":"Mathematical Programming"},{"key":"CR32","volume-title":"A globally convergent iterative algorithm for complementarity problems \u2014 a modification of interior point algorithms for linear complementarity problems \u2014","author":"T. Noma","year":"1991","unstructured":"T. Noma, \u201cA globally convergent iterative algorithm for complementarity problems \u2014 a modification of interior point algorithms for linear complementarity problems \u2014\u201d, Dr. Thesis, Dept. of Systems Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1991."},{"key":"CR33","volume-title":"Computational Methods in Optimization: Approach","author":"E. Polak","year":"1971","unstructured":"E. Polak,Computational Methods in Optimization: Approach (Academic Press, New York, 1971)."},{"key":"CR34","volume-title":"\u201cAn infeasible interior-point predictor-corrector algorithm for linear programming,\u201d Technical report","author":"F.A. Potra","year":"1992","unstructured":"F.A. Potra, \u201cAn infeasible interior-point predictor-corrector algorithm for linear programming,\u201d Technical report, Dept. of Mathematics, The University of Iowa, Iowa City, Iowa 52242, 1992."},{"key":"CR35","volume-title":"\u201cInterior point methods for nonlinear complementarity problems,\u201d Technical report","author":"F.A. Potra","year":"1991","unstructured":"F.A. Potra and Y. Ye, \u201cInterior point methods for nonlinear complementarity problems,\u201d Technical report, Dept. of Mathematics, The University of Iowa, Iowa City, Iowa 52242, 1991."},{"key":"CR36","volume-title":"\u201cIncorporating condition measures into the complexity theory of linear programming,\u201d Technical report","author":"J. Renegar","year":"1993","unstructured":"J. Renegar, \u201cIncorporating condition measures into the complexity theory of linear programming,\u201d Technical report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853-3801, 1993."},{"key":"CR37","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences 84","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, \u201cAn \u2018analytical centre\u2019 for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201d in:Lecture Notes in Control and Information Sciences 84 (Springer, New York, 1985) 866\u2013876."},{"key":"CR38","first-page":"118","volume-title":"New Methods for Linear Programming","author":"K. Tanabe","year":"1987","unstructured":"K. Tanabe, \u201cComplementarity-enforcing centered Newton method for mathematical programming,\u201d in: K. Tone, ed.,New Methods for Linear Programming (The Institute of Statistical Mathematics, Minamiazabu, Minato-ku, Tokyo 106, Japan, 1987) 118\u2013144."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0042787","volume-title":"System Modelling and Optimization","author":"K. Tanabe","year":"1988","unstructured":"K. Tanabe, \u201cCentered Newton method for mathematical programming,\u201d in: M. Iri and K. Yajima, eds,System Modelling and Optimization (Springer-Verlag, New York, 1988) 197\u2013206."},{"key":"CR40","volume-title":"\u201cProjected scaled steepest descent in Kojima\u2014Mizuno\u2014Yoshise's potential reduction algorithm for the linear complementarity problem,\u201d Technical Report No. 950","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd, \u201cProjected scaled steepest descent in Kojima\u2014Mizuno\u2014Yoshise's potential reduction algorithm for the linear complementarity problem,\u201d Technical Report No. 950, School of Operations Research and Industrial Engineering, College of Engineering, Cornell University, Ithaca, New York 14853-3801, 1990."},{"key":"CR41","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":"CR42","series-title":"Working Paper","volume-title":"Constant potential primal-dual algorithm: a framework","author":"L. Tun\u00e7el","year":"1992","unstructured":"L. Tun\u00e7el, \u201cConstant potential primal-dual algorithm: a framework,\u201d Working Paper, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853, July 1992."},{"key":"CR43","volume-title":"\u201cOn quadratic and O $$(\\sqrt {nL} )$$ convergence of a predictor- corrector algorithm for LCP","author":"Y. Ye","year":"1991","unstructured":"Y. Ye and K. Anstreicher, \u201cOn quadratic and O $$(\\sqrt {nL} )$$ convergence of a predictor- corrector algorithm for LCP,\u201d Research Report, Dept. of Management Sciences, University of Iowa, Iowa City, IA 52242, November 1991."},{"key":"CR44","doi-asserted-by":"crossref","volume-title":"\u201cA quadratically convergent O $$(\\sqrt {nL} )$$ -iteration algorithm for linear programming","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, O. G\u00fcler, R.A. Tapia and Y. Zhang, \u201cA quadratically convergent O $$(\\sqrt {nL} )$$ -iteration algorithm for linear programming,\u201d TR91-26, Dept. of Mathematical Sciences, Rice University, Houston, TX 77251-1892, August 1991.","DOI":"10.21236\/ADA455490"},{"key":"CR45","volume-title":"\u201cAn O $$(\\sqrt {nL} )$$ -iteration homogeneous and self-dual linear programming algorith","author":"Y. Ye","year":"1992","unstructured":"Y. Ye, M.J. Todd and S. Mizuno, \u201cAn O $$(\\sqrt {nL} )$$ -iteration homogeneous and self-dual linear programming algorithm,\u201d Research Report, Dept. of Management Sciences, University of Iowa, Iowa City, IA 52242, June 1992."},{"key":"CR46","volume-title":"Nonlinear Programming: A Unified Approach","author":"W.I. Zangwill","year":"1969","unstructured":"W.I. Zangwill,Nonlinear Programming: A Unified Approach (Prentice-Hall, Englewood Cliffs, N. J., 1969)."},{"key":"CR47","unstructured":"Y. Zhang, \u201cOn the convergence of an infeasible interior-point algorithm for linear programming and other problems,\u201dSiam Journal on Optimization, to appear."},{"key":"CR48","first-page":"539","volume":"36","author":"J. Zhu","year":"1992","unstructured":"J. Zhu, \u201cA path following algorithm for a class of convex programming problems,\u201dZeitschrift f\u00fcr Operations Research \u2014 Methods and Models of Operations Research 36 (1992) 539\u2013577.","journal-title":"Zeitschrift f\u00fcr Operations Research \u2014 Methods and Models of Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581689.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581689\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T03:06:54Z","timestamp":1625886414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":48,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["BF01581689"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01581689","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":["General Mathematics","Software"],"published":{"date-parts":[[1994,2]]}}}