{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T09:51:50Z","timestamp":1656237110523},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998,1]]},"DOI":"10.1007\/bf01581723","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:39:14Z","timestamp":1114681154000},"page":"129-160","source":"Crossref","is-referenced-by-count":32,"title":["Local convergence of predictor\u2014corrector infeasible-interior-point algorithms for SDPs and SDLCPs"],"prefix":"10.1007","volume":"80","author":[{"given":"Masakazu","family":"Kojima","sequence":"first","affiliation":[]},{"given":"Masayuki","family":"Shida","sequence":"additional","affiliation":[]},{"given":"Susumu","family":"Shindoh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"C. Helmberg, F. Rendl, R.J. Vanderbei, H. Wolkowicz, An interior-point method for semidefinite programming, SIAM Journal on Optimization 6 (1996) 342\u2013361.","journal-title":"SIAM Journal on Optimization"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M. Kojima","year":"1997","unstructured":"M. Kojima, S. Shindoh, S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problems, SIAM Journal on Optimization 7 (1997) 86\u2013125.","journal-title":"SIAM Journal on Optimization"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"F. Alizadeh, Interior point methods in semidefinite programming with application to combinatorial optimization, SIAM Journal on Optimization 5 (1995) 13\u201351.","journal-title":"SIAM Journal on Optimization"},{"key":"CR4","unstructured":"F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Primal-dual interior-point methods for semidefinite programming, Working Paper, 1994."},{"key":"CR5","volume-title":"Complexity of an Algorithm for Finding an Approximate Solution of a Semidefinite Program with no Regularity Assumption, Technical report OR 302-94","author":"R.M. Freund","year":"1994","unstructured":"R.M. Freund, Complexity of an Algorithm for Finding an Approximate Solution of a Semidefinite Program with no Regularity Assumption, Technical report OR 302-94, Operations Research Center, MIT press, Cambridge, MA, 1994."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1137\/0331064","volume":"31","author":"F. Jarre","year":"1993","unstructured":"F. Jarre, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM Journal on Control and Optimization 31 (1993) 1360\u20131377.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR7","volume-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Applications","author":"Yu.E. Nesterov","year":"1993","unstructured":"Yu.E. Nesterov, A.S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, 1993."},{"key":"CR8","first-page":"205","volume":"69","author":"L. Vandenberghe","year":"1995","unstructured":"L. Vandenberghe, S. Boyd, A primal-dual potential reduction method for problems involving matrix inequalities, Mathematical Programming 69 (1995) 205\u2013236.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe, S. Boyd, Semidefinite Programming, SIAM Review 38 (1996) 49\u201395.","journal-title":"SIAM Review"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno, A. Yoshise, A polynomial-time algorithm for a class of linear complementary problems, Mathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR11","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, I. Adler, Interior Path-Following Primal-Dual Algorithm, Part I: Linear Programming, Mathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, S. Mizuno, A. Yoshise, An $$o(\\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems, Mathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0805003","volume":"5","author":"S. Mizuno","year":"1995","unstructured":"S. Mizuno, M. Kojima, 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":"CR14","doi-asserted-by":"crossref","unstructured":"R.D.C. Monteiro, Primal-Dual Path Following Algorithms for Semidefinite Programming, SIAM Journal on Optimization (to appear).","DOI":"10.1137\/S1052623495293056"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno, A. Yoshise, A primal-dual interior point algorithm for linear programming, in: N. Megiddo (Ed.), Progress in Mathematical Programming: Interior Point and Related Methods, Springer, Berlin, 1989, pp. 29\u201347."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Y. Zhang, On Extending Primal-Dual Interior-Point Algorithms from Linear Programming to Semidefinite Programming, SIAM Journal on Optimization (to appear).","DOI":"10.1137\/S1052623495296115"},{"key":"CR17","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 algorithms for the horizontal linear complementarity problem, SIAM Journal on Optimization 4 (1994) 208\u2013227.","journal-title":"SIAM Journal on Optimization"},{"key":"CR18","volume-title":"A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming","author":"F.A. Potra","year":"1995","unstructured":"F.A. Potra, R. Sheng, A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming, Department of Mathematics, University of Iowa, Iowa City, IA 52242, October 1995."},{"key":"CR19","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, Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18 (1993) 964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR20","volume-title":"A predictor\u2014corrector method for semi-definite linear programming, Working paper","author":"C.-J. Lin","year":"1995","unstructured":"C.-J. Lin, R. Saigal, A predictor\u2014corrector method for semi-definite linear programming, Working paper, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109-2117, October 1995."},{"key":"CR21","volume-title":"Global and local convergence of predictor\u2014corrector infeasibleinterior-point algorithms for semidefinite programs, Research Report #305","author":"M. Kojima","year":"1995","unstructured":"M. Kojima, M. Shida, S. Shindoh, Global and local convergence of predictor\u2014corrector infeasibleinterior-point algorithms for semidefinite programs, Research Report #305, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, October 1995."},{"key":"CR22","unstructured":"F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Complementarity and nondegeneracy in semidefinite programming, Working Paper, 1995."},{"key":"CR23","volume-title":"SDPA (Semidefinite Programming Algorithm) \u2014 User's Manual \u2014 Technical Report B-308","author":"K. Fujisawa","year":"1995","unstructured":"K. Fujisawa, M. Kojima, K. Nakata, SDPA (Semidefinite Programming Algorithm) \u2014 User's Manual \u2014 Technical Report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, December 1995, Revised August 1996."},{"key":"CR24","volume-title":"A primitive interior point algorithm for semidefinite programs in Mathematica, Technical Report B-293","author":"M. Kojima","year":"1994","unstructured":"M. Kojima, A primitive interior point algorithm for semidefinite programs in Mathematica, Technical Report B-293, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, December 1994."},{"key":"CR25","unstructured":"J.-P.A. Haeberly, Private communication, February 1996."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/moor.21.2.382","volume":"21","author":"S. Mizuno","year":"1996","unstructured":"S. Mizuno, A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementarity condition, Mathematics of Operations Research 21 (1996) 382\u2013400.","journal-title":"Mathematics of Operations Research"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y. Ye","year":"1993","unstructured":"Y. Ye, K. Anstreicher, On quadratic and $$o(\\sqrt n L)$$ convergence of a predictor\u2014corrector algorithm for LCP, Mathematical Programming 62 (1993) 537\u2013551.","journal-title":"Mathematical Programming"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01300971","volume":"3","author":"R.D.C. Monteiro","year":"1994","unstructured":"R.D.C. Monteiro, S.J. Wright, Local convergence of interior-point algorithms for degenerate monotone LCP, Computational Optimization and Applications 3 (1994) 131\u2013155.","journal-title":"Computational Optimization and Applications"},{"key":"CR29","volume-title":"Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming, Working Paper","author":"Yu.E. Nesterov","year":"1994","unstructured":"Yu.E. Nesterov, M.J. Todd, Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming, Working Paper, CORE, Catholic University of Louvain, Louvain-la-Neuve, Belgium, April 1994."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Yu.E. Nesterov, M.J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM Journal on Optimization (to appear).","DOI":"10.1137\/S1052623495290209"},{"key":"CR31","volume-title":"Superlinear convergence of infeasible-interior-point algorithms for semidefinite programming","author":"F.A. Potra","year":"1996","unstructured":"F.A. Potra, R. Sheng, Superlinear convergence of infeasible-interior-point algorithms for semidefinite programming, Department of Mathematics, University of Iowa, Iowa City, IA 52242, April 1996."},{"key":"CR32","doi-asserted-by":"crossref","unstructured":"Z.-Q. Luo, J.S. Sturm, S. Zhang, Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming, SIAM Journal on Optimization (to appear).","DOI":"10.1137\/S1052623496299187"},{"key":"CR33","volume-title":"A predictor\u2014corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, Research Report #311","author":"M. Kojima","year":"1996","unstructured":"M. Kojima, M. Shida, S. Shindoh, A predictor\u2014corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, Research Report #311, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152, Japan, December 1996."},{"key":"CR34","doi-asserted-by":"crossref","unstructured":"F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM Journal On Optimization (to appear).","DOI":"10.1137\/S1052623496304700"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581723.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581723\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:20Z","timestamp":1556896340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["BF01581723"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01581723","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":[[1998,1]]}}}