{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:53:03Z","timestamp":1776271983267,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T00:00:00Z","timestamp":1708473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T00:00:00Z","timestamp":1708473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071108"],"award-info":[{"award-number":["12071108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11671116"],"award-info":[{"award-number":["11671116"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11991020"],"award-info":[{"award-number":["11991020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11971372"],"award-info":[{"award-number":["11971372"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11991021"],"award-info":[{"award-number":["11991021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDA27000000"],"award-info":[{"award-number":["XDA27000000"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12021001"],"award-info":[{"award-number":["12021001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10589-024-00558-8","type":"journal-article","created":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T15:03:29Z","timestamp":1708527809000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming"],"prefix":"10.1007","volume":"88","author":[{"given":"Rui-Jin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xin-Wei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,21]]},"reference":[{"key":"558_CR1","unstructured":"Alizadeh, F., Haeberly, J., Nayakkankuppa, M., Overton, M., Schmieta, S.: SDPPACK User\u2019s Guide\u2013Version 0.9 Beta for Matlab 5.0. New York University (1997)"},{"issue":"1","key":"558_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5(1), 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"558_CR3","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F 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 J. Optim. 8(3), 746\u2013768 (1998)","journal-title":"SIAM J. Optim."},{"key":"558_CR4","volume-title":"Practical Optimization: Algorithms and Engineering Applications","author":"A Antoniou","year":"2007","unstructured":"Antoniou, A., Lu, W.S.: Practical Optimization: Algorithms and Engineering Applications, vol. 19. Springer, New York (2007)"},{"issue":"2","key":"558_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/S1052623497328008","volume":"10","author":"SJ Benson","year":"2000","unstructured":"Benson, S.J., Ye, Y.Y., Zhang, X.: Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim. 10(2), 443\u2013461 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"558_CR6","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1080\/10556789908805769","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: SDPLIB 1.2, a library of semidefinite programming test problems. Optim. Methods Softw. 11(1\u20134), 683\u2013690 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"558_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"558_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.D.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103(3), 427\u2013444 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"558_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10107-002-0306-1","volume":"95","author":"X Chen","year":"2003","unstructured":"Chen, X., Tseng, P.: Non-interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95(3), 431\u2013474 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"558_CR10","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.3934\/jimo.2018190","volume":"16","author":"YH Dai","year":"2020","unstructured":"Dai, Y.H., Liu, X.W., Sun, J.: A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs. J. Ind. Manag. Optim. 16(2), 1009\u20131035 (2020)","journal-title":"J. Ind. Manag. Optim."},{"issue":"1\u20133","key":"558_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1080\/10556789408805564","volume":"3","author":"C De Simone","year":"1994","unstructured":"De Simone, C., Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optim. Methods Softw. 3(1\u20133), 195\u2013214 (1994)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"558_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"558_CR13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-005-0661-9","volume":"105","author":"I Fischer","year":"2006","unstructured":"Fischer, I., Gruber, G., Rendl, F., Sotirov, R.: Computational experience with a bundle approach for semidefinite cutting plane relaxations of max-cut and equipartition. Math. Program. 105(2), 451\u2013469 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"558_CR14","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"558_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York (2012)"},{"key":"558_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11424-011-8045-0","volume":"24","author":"ZH Huang","year":"2011","unstructured":"Huang, Z.H., Liu, X.H.: Extension of smoothing Newton algorithms to solve linear programming over symmetric cones. J. Syst. Sci. Complex. 24, 195\u2013206 (2011)","journal-title":"J. Syst. Sci. Complex."},{"issue":"1","key":"558_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623401390525","volume":"13","author":"C Kanzow","year":"2002","unstructured":"Kanzow, C., Nagel, C.: Semidefinite programs: new search directions, smoothing-type methods, and numerical results. SIAM J. Optim. 13(1), 1\u201323 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"558_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7(1), 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"558_CR19","doi-asserted-by":"publisher","first-page":"4131","DOI":"10.1137\/18M1188069","volume":"40","author":"YF Li","year":"2018","unstructured":"Li, Y.F., Wen, Z.W., Yang, C., Yuan, Y.X.: A semismooth Newton method for semidefinite programs and its applications in electronic structure calculations. SIAM J. Sci. Comput. 40(6), 4131\u20134157 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"558_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A Lisser","year":"2003","unstructured":"Lisser, A., Rendl, F.: Graph partitioning using linear and semidefinite programming. Math. Program. 95(1), 91\u2013101 (2003)","journal-title":"Math. Program."},{"issue":"323","key":"558_CR21","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1090\/mcom\/3487","volume":"89","author":"XW Liu","year":"2019","unstructured":"Liu, X.W., Dai, Y.H.: A globally convergent primal-dual interior-point relaxation method for nonlinear programs. Math. Comput. 89(323), 1301\u20131329 (2019)","journal-title":"Math. Comput."},{"issue":"3","key":"558_CR22","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00186-022-00797-7","volume":"96","author":"XW Liu","year":"2022","unstructured":"Liu, X.W., Dai, Y.H., Huang, Y.K.: A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs. Math. Methods Oper. Res. 96(3), 351\u2013382 (2022)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"558_CR23","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1137\/17M115075X","volume":"29","author":"C Lu","year":"2019","unstructured":"Lu, C., Liu, Y.F., Zhang, W.Q., Zhang, S.Z.: Tightness of a new and enhanced semidefinite relaxation for MIMO detection. SIAM J. Optim. 29(1), 719\u2013742 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"558_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"ZQ Luo","year":"2010","unstructured":"Luo, Z.Q., Ma, W.K., So, A.M.-C., Ye, Y.Y., Zhang, S.Z.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27(3), 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"558_CR25","unstructured":"Mironowicz, P.: Applications of semidefinite optimization in quantum information protocols. arXiv preprint arXiv:1810.05145 (2018)"},{"issue":"3","key":"558_CR26","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RD Monteiro","year":"1997","unstructured":"Monteiro, R.D.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7(3), 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"558_CR27","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S1052623496308618","volume":"8","author":"RD Monteiro","year":"1998","unstructured":"Monteiro, R.D.: Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions. SIAM J. Optim. 8(3), 797\u2013812 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"558_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10107-003-0451-1","volume":"97","author":"RD Monteiro","year":"2003","unstructured":"Monteiro, R.D.: First-and second-order methods for semidefinite programming. Math. Program. 97(1), 209\u2013244 (2003)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"558_CR29","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/10556789908805749","volume":"11","author":"RD Monteiro","year":"1999","unstructured":"Monteiro, R.D., Zanjacomo, P.: Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants. Optim. Methods Softw. 11(1\u20134), 91\u2013140 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"558_CR30","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"SH Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96(3), 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"558_CR31","doi-asserted-by":"crossref","unstructured":"Siddhu, V., Tayur, S.: Five starter pieces: Quantum information science via semidefinite programs. arXiv preprint arXiv:2112.08276 (2021)","DOI":"10.1287\/educ.2022.0243"},{"key":"558_CR32","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20134","key":"558_CR33","first-page":"1","volume":"11","author":"MJ Todd","year":"1999","unstructured":"Todd, M.J.: A study of search directions in primal-dual interior-point methods for semidefinite programming. Optim. Methods Softw. 11(1\u20134), 1\u201346 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"558_CR34","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1137\/S105262349630060X","volume":"8","author":"MJ Todd","year":"1998","unstructured":"Todd, M.J., Toh, K.C., T\u00fct\u00fcnc\u00fc, R.H.: On the Nesterov\u2013Todd direction in semidefinite programming. SIAM J. Optim. 8(3), 769\u2013796 (1998)","journal-title":"SIAM J. Optim."},{"key":"558_CR35","doi-asserted-by":"crossref","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: On the implementation and usage of SDPT3-a Matlab software package for semidefinite quadratic linear programming, version 4.0. In: Handbook on Semidefinite. Conic and Polynomial Optimization, pp. 715\u2013754. Springer, Boston (2012)","DOI":"10.1007\/978-1-4614-0769-0_25"},{"issue":"3\u20134","key":"558_CR36","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"ZW Wen","year":"2010","unstructured":"Wen, Z.W., Goldfarb, D., Yin, W.T.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3\u20134), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"6","key":"558_CR37","doi-asserted-by":"publisher","first-page":"3335","DOI":"10.1137\/060676970","volume":"20","author":"H Yamashita","year":"2010","unstructured":"Yamashita, H., Tanabe, T.: A primal-dual exterior point method for nonlinear optimization. SIAM J. Optim. 20(6), 3335\u20133363 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"558_CR38","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"LQ Yang","year":"2015","unstructured":"Yang, L.Q., Sun, D.F., Toh, K.C.: SDPNAL $$+ $$: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"558_CR39","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s10898-023-01314-8","volume":"87","author":"RJ Zhang","year":"2023","unstructured":"Zhang, R.J., Liu, X.W., Dai, Y.H.: IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming. J. Global Optim. 87(2), 1027\u20131053 (2023)","journal-title":"J. Global Optim."},{"issue":"2","key":"558_CR40","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8(2), 365\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"558_CR41","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D.F., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"558_CR42","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10107-019-01366-3","volume":"180","author":"Y Zheng","year":"2020","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Chordal decomposition in operator-splitting methods for sparse semidefinite programs. Math. Program. 180(1), 489\u2013532 (2020)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00558-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00558-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00558-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T10:49:24Z","timestamp":1714128564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00558-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,21]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["558"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00558-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,21]]},"assertion":[{"value":"16 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}