{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:35:26Z","timestamp":1772750126310,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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,5]]},"DOI":"10.1007\/bf01580085","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:37:08Z","timestamp":1114666628000},"page":"281-299","source":"Crossref","is-referenced-by-count":62,"title":["A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming"],"prefix":"10.1007","volume":"81","author":[{"given":"Renato DC","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Combinatorial Optimization with Interior Point Methods and Semi-Definite Matrices","author":"F. Alizadeh","year":"1991","unstructured":"F. Alizadeh, Combinatorial Optimization with Interior Point Methods and Semi-Definite Matrices, Ph.D. Thesis, Computer Science Department, University of Minnesota, Minneapolis, 1991."},{"key":"CR2","volume-title":"Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, Technical report","author":"F. Alizadeh","year":"1996","unstructured":"F. Alizadeh, J.A. Haeberly, M. Overton, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, Technical report, Computer Science Department, New York University, New York, 1996."},{"key":"CR3","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":"CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"R.A. Horn","year":"1991","unstructured":"R.A. Horn, C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, New York, 1991."},{"key":"CR5","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":"CR6","first-page":"29","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 method for linear programming, in: Nimrod Megiddo (Ed.), Progress in Mathematical Programming, Interior-Point and Related Methods, Springer, New York, 1989, pp. 29\u201347."},{"key":"CR7","first-page":"129","volume":"80","author":"M. Kojima","year":"1998","unstructured":"M. Kojima, M. Shida, S. Shindoh, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Mathematical Programming 80 (1998) 129\u2013160.","journal-title":"Mathematical Programming"},{"key":"CR8","volume-title":"A note on the Nesterov-Todd and the Kojima-Shindoh-Hara search directions in semidefinite programming, Research Report #B-313","author":"M. Kojima","year":"1996","unstructured":"M. Kojima, M. Shida, S. Shindoh, A note on the Nesterov-Todd and the Kojima-Shindoh-Hara search directions in semidefinite programming, Research Report #B-313, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1996."},{"key":"CR9","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 problem in symmetric matrices, SIAM Journal on Optimization 7 (1997) 86\u2013125.","journal-title":"SIAM Journal on Optimization"},{"key":"CR10","volume-title":"A predictor-corrector method for semi-definite programming, Working paper","author":"C-J. Lin","year":"1995","unstructured":"C-J. Lin, R. Saigal, A predictor-corrector method for semi-definite programming, Working paper, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109-2177, 1995."},{"key":"CR11","unstructured":"Z-Q. Luo, J.F. Sturm, S. Zhang, Superlinear convergence of a symmetric primal-dual path-following algorithms for semidefinite programming, Working paper, 1996 (to appear in SIAM Journal on Optimization)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RDC Monteiro","year":"1997","unstructured":"R.D.C. Monteiro, Primal-dual path-following algorithms for semidefinite programming, SIAM Journal on Optimization 7 (1997) 663\u2013678.","journal-title":"SIAM Journal on Optimization"},{"key":"CR13","volume-title":"Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions, Manuscript","author":"RDC Monteiro","year":"1996","unstructured":"R.D.C. Monteiro, Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions, Manuscript, School of ISyE, Georgia Institute of Technology, Atlanta, GA 30332, USA, 1996."},{"key":"CR14","first-page":"509","volume":"24","author":"Y.E. Nesterov","year":"1988","unstructured":"Y.E. Nesterov, A.S. Nemirovskii, A general approach to the design of optimal methods for smooth convex functions minimization, Ekonomika i Matem, Metody 24 (1988) 509\u2013517 (In Russian; English transl. Matekon: Translations of Russian and East European Math. Economics.).","journal-title":"Ekonomika i Matem, Metody"},{"key":"CR15","volume-title":"Self-concordant functions and polynomial time methods in convex programming","author":"Y.E. Nesterov","year":"1989","unstructured":"Y.E. Nesterov, A.S. Nemirovskii, Self-concordant functions and polynomial time methods in convex programming, Preprint, Central Economic & Mathematical Institute, USSR Acadamy of Science, Moscow, USSR, 1989."},{"key":"CR16","volume-title":"Optimization over positive semidefinite matrices: Mathematical background and user's manual, Technical report","author":"Y.E. Nesterov","year":"1990","unstructured":"Y.E. Nesterov, A.S. Nemirovskii, Optimization over positive semidefinite matrices: Mathematical background and user's manual, Technical report, Central Economic & Mathematical Institute, USSR Academy of Science Moscow, USSR, 1990."},{"key":"CR17","volume-title":"Interior Point Methods in Convex Programming: Theory and Applications","author":"Y.E. Nesterov","year":"1994","unstructured":"Y.E. Nesterov, A.S. Nemirovskii, Interior Point Methods in Convex Programming: Theory and Applications, Society for Industrial and Applied Mathematics, Philadelphia, 1994."},{"key":"CR18","volume-title":"Self-scaled barriers and interior-point methods for convex programming, Technical Report 1091","author":"Y.E. Nesterov","year":"1995","unstructured":"Y.E. Nesterov, M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Technical Report 1091, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 14853-3801, 1995."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y.E. Nesterov","year":"1997","unstructured":"Y.E. Nesterov, M.J. Todd, Primal-dual interior-point methods for self-scaled cones, Mathematics of Operations Research 22 (1997) 1\u201342.","journal-title":"Mathematics of Operations Research"},{"key":"CR20","unstructured":"F.A. Potra, R. Sheng, A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming, Reports on Computational Mathematics, No. 78, Department of Mathematics, The University of Iowa, 1995."},{"key":"CR21","unstructured":"M. Shida, S. Shindoh, M. Kojima, Existence of search directions in interior-point algorithms for the SDP and monotone SDLCP, Technical Report B-310, Department of Mathematical and Computer Science, Tokyo Institute of Technology, 1996 (to appear in SIAM Journal on Optimization)."},{"key":"CR22","volume-title":"Symmetric primal-dual path-following algorithms for semidefinite programming, Report 9554\/A","author":"J.F. Sturm","year":"1995","unstructured":"J.F. Sturm, S. Zhang, Symmetric primal-dual path-following algorithms for semidefinite programming, Report 9554\/A, Ecometric Institute, Erasmus University Rotterdam, The Netherlands, 1995."},{"key":"CR23","volume-title":"On the long-step path-following method for semidefinite programming, Report 9638\/A","author":"J.F. Sturm","year":"1996","unstructured":"J.F. Sturm, S. Zhang, On the long-step path-following method for semidefinite programming, Report 9638\/A, Ecometric Institute, Erasmus University Rotterdam, The Netherlands, 1996."},{"key":"CR24","volume-title":"On the Nesterov-Todd direction in semidefinite programming, Technical Report","author":"M.J. Todd","year":"1996","unstructured":"M.J. Todd, K.C. Toh, R.H. T\u00fct\u00fcnc\u00fc, On the Nesterov-Todd direction in semidefinite programming, Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA, 1996."},{"key":"CR25","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":"CR26","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1137\/0219030","volume":"19","author":"Y. Ye","year":"1990","unstructured":"Y. Ye, A class of projective transformations for linear programming, SIAM Journal on Computing 19 (1990) 457\u2013466.","journal-title":"SIAM Journal on Computing"},{"key":"CR27","unstructured":"Y. Zhang, On extending some primal-dual interior-Point algorithms from linear programming to semidefinite programming, Technical Report, 1995 (to appear in SIAM Journal on Optimization)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580085\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:09:13Z","timestamp":1556881753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["BF01580085"],"URL":"https:\/\/doi.org\/10.1007\/bf01580085","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}