{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T19:44:48Z","timestamp":1786045488612,"version":"3.56.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,12,29]],"date-time":"2004-12-29T00:00:00Z","timestamp":1104278400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10107-004-0564-1","type":"journal-article","created":{"date-parts":[[2004,12,29]],"date-time":"2004-12-29T05:34:13Z","timestamp":1104298453000},"page":"427-444","source":"Crossref","is-referenced-by-count":265,"title":["Local Minima and Convergence in Low-Rank Semidefinite Programming"],"prefix":"10.1007","volume":"103","author":[{"given":"Samuel","family":"Burer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato D.C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2004,12,29]]},"reference":[{"key":"564_CR1","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberly, J.-P.A., Overton. M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization, 8, 746\u2013768 (1998)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR2","doi-asserted-by":"crossref","unstructured":"K.M. Anstreicher. Recent advances in the solution of quadratic assignment problems. Mathematical Programming (Series B), 97 (1\u20132), 27\u201342 (2003)","DOI":"10.1007\/s10107-003-0437-z"},{"key":"564_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.2140\/pjm.1975.57.15","volume":"57","author":"Barker","year":"1","unstructured":"Barker, G.P., Carlson, D.: Cones of diagonally dominant matrices. Pacific Journal of Mathematics, 57 (1), 15\u201332 (1975)","journal-title":"Pacific Journal of Mathematics,"},{"key":"564_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/S105262340240851X","volume":"14","author":"Burer","year":"1","unstructured":"Burer, S.: Semidefinite programming in the space of partial positive semidefinite matrices. SIAM Journal on Optimization, 14 (1), 139\u2013172 (2003)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming (Series B), 95, 329\u2013357 (2003)","journal-title":"Mathematical Programming (Series B),"},{"key":"564_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s101070100279","volume":"93","author":"Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D.C., Zhang. Y.: Solving a class of semidefinite programs via nonlinear programming. Mathematical Programming, 93, 97\u2013122 (2002)","journal-title":"Mathematical Programming,"},{"key":"564_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"Burkard","year":"1991","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB \u2013 a quadratic assignment problem library. European Journal of Operational Research, 55,115\u2013119 (1991)","journal-title":"European Journal of Operational Research,"},{"key":"564_CR8","unstructured":"Helmberg, C.: Semidefinite programming for combinatorial optimization. ZIB-Report 00-34, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, October 2000."},{"key":"564_CR9","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673\u2013696 (2000)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR10","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM Journal on Optimization, 6, 342\u2013361 (1996)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR11","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C., Convex analysis and minimization algorithms. I, volume 305 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 1993.","DOI":"10.1007\/978-3-662-02796-7"},{"key":"564_CR12","doi-asserted-by":"crossref","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York, 1985.","DOI":"10.1017\/CBO9780511810817"},{"key":"564_CR13","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization, 7, 86\u2013125 (1997)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR14","unstructured":"Lin, C-J., Saigal, R.: On solving large scale semidefinite programming problems: a case study of quadratic assigment problem. Technical Report, Dept. of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2177, 1997."},{"key":"564_CR15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10107-003-0451-1","volume":"97","author":"Monteiro","year":"2003","unstructured":"Monteiro, R.D.C.: First- and second-order methods for semidefinite programming. Mathematical Programming, 97, 209\u2013244 (2003)","journal-title":"Mathematical Programming,"},{"key":"564_CR16","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"Monteiro","year":"1997","unstructured":"Monteiro, R.D.C.: Primal-dual path following algorithms for semidefinite programming. SIAM Journal on Optimization, 7, 663\u2013678 (1997)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR17","first-page":"281","volume":"81","author":"Monteiro","year":"1998","unstructured":"Monteiro, R.D.C., Zhang, Y.: A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Mathematical Programming, 81, 281\u2013299 (1998)","journal-title":"Mathematical Programming,"},{"key":"564_CR18","first-page":"297","volume":"46","author":"Nakata","year":"1998","unstructured":"Nakata, K., Fujisawa, K., Kojima, M.: Using the conjugate gradient method in interior-points for semidefinite programs. Proceedings of the Institute of Statistical Mathematics, 46, 297\u2013316 (1998) In Japanese.","journal-title":"Proceedings of the Institute of Statistical Mathematics,"},{"key":"564_CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"Pataki","year":"1998","unstructured":"Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Mathematics of Operations Research, 23, 339\u2013358 (1998)","journal-title":"Mathematics of Operations Research,"},{"key":"564_CR20","doi-asserted-by":"crossref","unstructured":"Pataki, G.: The geometry of semidefinite programming. In H. Wolkowicz, R. Saigal, L. Vandenberghe, (eds.), Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Kluwer Academic Publishers, 2000.","DOI":"10.1007\/978-1-4615-4381-7_3"},{"key":"564_CR21","unstructured":"Rendl, F., Sotirov, R.: Bounds for the quadratic assignment problem using the bundle method. Manuscript, University of Klagenfurt, August 2003."},{"key":"564_CR22","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, NJ, 1970.","DOI":"10.1515\/9781400873173"},{"key":"564_CR23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"Simone","year":"1989","unstructured":"De Simone, C.: The cut polytope and the boolean quadric polytope. Discrete Mathematics, 79, 71\u201375 (1989)","journal-title":"Discrete Mathematics,"},{"key":"564_CR24","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1137\/S1052623402419819","volume":"14","author":"Toh","year":"2004","unstructured":"Toh, K.C.: Solving large scale semidefinite programs via an iterative solver on the agumented systems. SIAM Journal on Optimization, 14, 670\u2013698 (2004)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR25","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/S1052623400376378","volume":"12","author":"Toh","year":"2002","unstructured":"Toh, K.C., Kojima, M.: Solving some large scale semidefinite programs via the conjugate residual method. SIAM Journal on Optimization, 12, 669\u2013691 (2002)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR26","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Zhang","year":"1998","unstructured":"Zhang, Y.: On extending some primal\u2013dual interior\u2013point algorithms from linear programming to semidefinite programming. SIAM Journal on Optimization, 8, 365\u2013386 (1998)","journal-title":"SIAM Journal on Optimization,"},{"key":"564_CR27","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. Journal of Combinatorial Optimization, 2, 71\u2013109 (1998)","journal-title":"Journal of Combinatorial Optimization,"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0564-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0564-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0564-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T01:34:21Z","timestamp":1586050461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0564-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12,29]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["564"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0564-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12,29]]}}}