{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:30:29Z","timestamp":1680435029673},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-3","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\/bf02680567","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T12:52:17Z","timestamp":1185540737000},"page":"393-406","source":"Crossref","is-referenced-by-count":1,"title":["Affine scaling algorithm fails for semidefinite programming"],"prefix":"10.1007","volume":"83","author":[{"given":"Masakazu","family":"Muramatsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02680567_CR1","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":"BF02680567_CR2","series-title":"Technical Report, Computer Science Department, Report 659","volume-title":"Primal-dual interior-point methods for semidefinite programming","author":"F. Alizadeh","year":"1994","unstructured":"F. Alizadeh, J.P.A. Haeberly, M.L. Overton, Primal-dual interior-point methods for semidefinite programming, Technical Report, Computer Science Department, Report 659, Courant Institute of Mathematical Sciences, New York University, New York, USA, 1994."},{"key":"BF02680567_CR3","first-page":"111","volume":"77","author":"F. Alizadeh","year":"1997","unstructured":"F. Alizadeh, J.P.A. Haeberly, M.L. Overton, Complementarity and nondegeneracy in semidefinite programming, Mathematical Programming 77 (1997) 111\u2013128.","journal-title":"Mathematical Programming"},{"key":"BF02680567_CR4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems, Mathematical Programming 36 (1986) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"BF02680567_CR5","first-page":"747","volume":"174","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Doklady Akademii Nauk SSSR 174 (1967) 747\u2013748 (Translated in: Soviet Mathematics Doklady 8 (1967) 674\u2013675).","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"3","key":"BF02680567_CR6","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479893251939","volume":"16","author":"L. Faybusovich","year":"1995","unstructured":"L. Faybusovich, On a matrix generalization of affine-scaling vector fields, SIAM Journal on Matrix Analysis and Application 16 (3) (1995) 886\u2013897.","journal-title":"SIAM Journal on Matrix Analysis and Application"},{"key":"BF02680567_CR7","first-page":"237","volume-title":"Lecture notes in control and information sciences 197","author":"L. Faybusovich","year":"1994","unstructured":"L. Faybusovich, Dikin's algorithm for matrix linear programming problems, in: J. Henry, J. Pavon (Eds.) Lecture notes in control and information sciences 197, Springer, Berlin, 1994, pp. 237\u2013247."},{"key":"BF02680567_CR8","series-title":"Technical Report","volume-title":"Interior point trajectories in semidefinite programming","author":"D. Goldfarb","year":"1996","unstructured":"D. Goldfarb, K. Scheinberg, Interior point trajectories in semidefinite programming, Technical Report, Department of IE\/OR, Columbia University, New York, USA, 1996."},{"key":"BF02680567_CR9","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":"BF02680567_CR10","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"},{"issue":"4","key":"BF02680567_CR11","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 (4) (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02680567_CR12","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":"BF02680567_CR13","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":"BF02680567_CR14","series-title":"Working Paper","volume-title":"A predictor-corrector method for semi-definite programming","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":"BF02680567_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1137\/S1052623496299187","volume":"8","author":"Z-Q. Luo","year":"1998","unstructured":"Z-Q. Luo, J.F. Sturm, S. Zhang, Superlinear convergence of a symmetric primal-dual path-following algorithms for semidefinite programming, SIAM Journal on Optimization 8 (1998) 59\u201381.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02680567_CR16","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/S1052623493258404","volume":"7","author":"W.F. Mascarenhas","year":"1997","unstructured":"W.F. Mascarenhas, The affine scaling algorithm fails for \u03bb=0.999, SIAM Journal on Optimization 7 (1997) 34\u201346.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02680567_CR17","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"R.D.C. 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":"BF02680567_CR18","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF02023109","volume":"47","author":"R.D.C. Monteiro","year":"1993","unstructured":"R.D.C. Monteiro, T. Tsuchiya, Y. Wang, A simplified global convergence proof of the affine scaling algorithm, Annals of Operations Research 47 (1993) 443\u2013482.","journal-title":"Annals of Operations Research"},{"key":"BF02680567_CR19","first-page":"281","volume":"81","author":"R.D.C. Monteiro","year":"1998","unstructured":"R.D.C. Monteiro, Y. Zhang, A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming, Mathematical Programming 81 (1998) 281\u2013299.","journal-title":"Mathematical Programming"},{"key":"BF02680567_CR20","unstructured":"M. Muramatsu, R.J. Vanderbei, Primal-dual affine-scaling algorithms fail for semidefinite programming, DIMACS Technical Report 97-37, 1997."},{"key":"BF02680567_CR21","series-title":"Technical Report","volume-title":"Optimization over positive semidefinite matrices: Mathematical background and user's manual","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":"BF02680567_CR22","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Nemirovskii, Interior-point polynomial alogirithms in convex programming","author":"Y. E. A. Nesterov","year":"1994","unstructured":"Yu. E. Nesterov, A. Nemirovskii, Interior-point polynomial alogirithms in convex programming, SIAM, Philadelphia, PA, USA, 1994."},{"key":"BF02680567_CR23","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, Self-scaled barriers and interior-point methods for convex programming, Mathematics of Operations Research 22 (1997) 1\u201342.","journal-title":"Mathematics of Operations Research"},{"key":"BF02680567_CR24","unstructured":"Y.E. 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, USA, to appear in SIAM Journal on Optimization."},{"issue":"8\/9","key":"BF02680567_CR25","first-page":"165","volume":"26","author":"M.J.D. Powell","year":"1990","unstructured":"M.J.D. Powell, Karmarkar's algorithm: A view from nonlinear programming, Bulletin of the Institute of Mathematics and Its Applications 26 (8\/9) (1990) 165\u2013181.","journal-title":"Bulletin of the Institute of Mathematics and Its Applications"},{"key":"BF02680567_CR26","series-title":"Reports on Computational Mathematics","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, Reports on Computational Mathematics No. 78, Department of Mathematics, The University of Iowa, Iowa, USA, 1995."},{"key":"BF02680567_CR27","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02206821","volume":"62","author":"R. Saigal","year":"1996","unstructured":"R. Saigal, A simple proof of primal affine scaling method, Annals of Operations Research 62 (1996) 303\u2013324.","journal-title":"Annals of Operations Research"},{"key":"BF02680567_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2311-6","volume-title":"Linear programming: A modern integrated analysis","author":"R. Saigal","year":"1995","unstructured":"R. Saigal, Linear programming: A modern integrated analysis, Kluwer Academic Publishers, USA, 1995."},{"key":"BF02680567_CR29","series-title":"Report 9554\/A","volume-title":"Symmetric primal-dual path-following algorithms for semidefinite programming","author":"J.F. Sturm","year":"1995","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":"BF02680567_CR30","series-title":"Research Memorandum","volume-title":"A note on Mascarenhas' counter example about global convergence of the affine scaling algorithm","author":"T. Terlaky","year":"1996","unstructured":"T. Terlaky, T. Tsuchiya, A note on Mascarenhas' counter example about global convergence of the affine scaling algorithm, Research Memorandum 596, The Institute of Statistical Mathematics, Tokyo, Japan, 1996."},{"issue":"3","key":"BF02680567_CR31","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0805027","volume":"5","author":"T. Tsuchiya","year":"1995","unstructured":"T. Tsuchiya, M. Muramatsu, Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems, SIAM Journal on Optimization 5 (3) (1995) 525\u2013551.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02680567_CR32","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"},{"issue":"1","key":"BF02680567_CR33","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/moor.20.1.163","volume":"20","author":"R.J. Vanderbei","year":"1995","unstructured":"R.J. Vanderbei, Affine scaling trajectories associated with a semi-infinite linear program, Mathematics of Operations Research 20 (1) (1995) 163\u2013174.","journal-title":"Mathematics of Operations Research"},{"key":"BF02680567_CR34","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon, B.A. Freedman, A modification of Karmarkar's linear programming algorithm, Algorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"},{"key":"BF02680567_CR35","unstructured":"Y. Zhang, On extending primal-dual interior-algorithms from linear programming to semidefinite programming, Technical Report TR95-20, Department of Math\/Stat, University of Maryland, Baltimore County, Baltimore, Maryland, USA, 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\/BF02680567.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02680567\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02680567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T11:52:31Z","timestamp":1558353151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02680567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["BF02680567"],"URL":"https:\/\/doi.org\/10.1007\/bf02680567","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}