{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:01:28Z","timestamp":1787497288667,"version":"build-2736575974"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0167-6377(98)00018-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"53-61","source":"Crossref","is-referenced-by-count":4,"title":["A long-step primal\u2013dual path-following method for semidefinite programming"],"prefix":"10.1016","volume":"23","author":[{"given":"Jianmin","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00018-2_BIB1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","article-title":"Interior point methods in semidefinite programming with applications to combinatorial optimization problems","volume":"5","author":"Alizadeh","year":"1995","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB2","unstructured":"F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Complementarity and nondegeneracy in semidefinite programming, RUTCOR, Rutgers University, New Brunswick, NJ, 1995."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB3","unstructured":"K.M. Anstreicher, M. Fampa, A long-step path following algorithm for semidefinite programming problems, Working Paper, 1996."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01769704","article-title":"A long step barrier method for convex quadratic programming","volume":"10","author":"Anstreicher","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-6377(98)00018-2_BIB5","doi-asserted-by":"crossref","unstructured":"D. Den Hertog, Interior Point Approach to Linear, Quadratic and Convex Programming Kluwer Academic Publishers, Dordrecht, 1994.","DOI":"10.1007\/978-94-011-1134-8"},{"key":"10.1016\/S0167-6377(98)00018-2_BIB6","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479893251939","article-title":"On a matrix generalization of affine-scaling vector fields","volume":"16","author":"Faybusovich","year":"1995","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB7","unstructured":"L. Faybusovich, Semi-definite programming: a path-following algorithm for linear-quadratic functional, Technical Report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, USA, 1995; SIAM J. Optim., to appear."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB8","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, 1994."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB9","unstructured":"B. He, E. de Klerk, C. Roos, T. Terlaky, Method of approximate centers for semi-definite programming, Report 96-27, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands, 1996."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB10","unstructured":"C. Helmberg, F. Rendl, R.J. Vanderbei, H. Wolkowicz, An interior-point method for semidefinite programming. Manuscript, 1994; SIAM J. Optim., to appear."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02191759","article-title":"Primal-dual algorithms for linear programming based on the logarithmic barrier method","volume":"83","author":"Jansen","year":"1994","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB12","first-page":"168","article-title":"A logarithmic barrier Newton method for semidefinite programming","volume":"10","author":"Jiang","year":"1997","journal-title":"Systems Sci. Math. Sci."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB13","unstructured":"M. Kojima, S. Shindoh, S. Hara, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, Research Report on Information Sciences, B-282, Dept. of Information Sciences, Tokyo Institute ofTechnology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1995."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB14","unstructured":"R.D.C. Monteiro, Primal-dual path following algorithms for semidefinite programming, Manuscript, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1995."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB15","series-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Algorithm","author":"Nesterov","year":"1993"},{"key":"10.1016\/S0167-6377(98)00018-2_BIB16","unstructured":"Y. Nesterov M.J. Todd, Primal-dual interior-point methods for self-scaled cones, Technical Report 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1995."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB17","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0609021","article-title":"On minimizing the maximum eigenvalue of a symmetric matrix","volume":"9","author":"Overton","year":"1988","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB18","unstructured":"M. Ramana, L. Tuncel, H. Wolkowicz, Strong duality for semidefinite programming, Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1995."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB19","unstructured":"C. Roos, J.-Ph. Vial, Long steps with the logarithmic penalty barrier function, in: J. Gabszevwicz, J.-F. Richard, L. Wolsey (Eds.), Economic Decision-Making: Games, Economics and Optimization (dedicated to Jacques H. Dr\u00e8ze), Elsevier Science Publishers, Amsterdam, 1990, pp. 433\u2013441."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","article-title":"A polynomial method of approximate centers for linear programming","volume":"54","author":"Roos","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00018-2_BIB21","unstructured":"J.F. Sturm, S. Zhang, Symmetric primal-dual path following algorithms for semidefinite programming, Report 9554\/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands, 1995."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB22","unstructured":"M.J. Todd, K.C. Toh, R.H. T\u00fct\u00fcnc\u00fc, On the Nesterov\u2013Todd direction in semidefinite programming, Technical Report 1154, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 1996."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB23","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01585558","article-title":"A primal-dual potential reduction method for problems involving matrix inequalities","volume":"69","author":"Vandenberghe","year":"1995","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00018-2_BIB24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","article-title":"Semidefinite programming","volume":"38","author":"Vandenberghe","year":"1996","journal-title":"SIAM Rev."},{"key":"10.1016\/S0167-6377(98)00018-2_BIB25","unstructured":"Y. Zhang, On extending primal-dual interior-point algorithms from linear programming to semidefinite programming, Technical Report, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, Maryland, USA, 1995."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000182?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000182?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:54:28Z","timestamp":1555563268000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0167637798000182"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00018-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}