{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:56:58Z","timestamp":1775591818083,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (B)18H03206"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (B)18H03206"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (B)18H03206"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (B)18H03206"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Young Scientists 19K20217"],"award-info":[{"award-number":["Grant-in-Aid for Young Scientists 19K20217"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (C)17K00031"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (C)17K00031"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Japan Society for the Promotion of Scie","award":["(B)20H04145"],"award-info":[{"award-number":["(B)20H04145"]}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["Young Scientists 20K19748"],"award-info":[{"award-number":["Young Scientists 20K19748"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["(B)20H04145"],"award-info":[{"award-number":["(B)20H04145"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["21H03398"],"award-info":[{"award-number":["21H03398"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["21H03398"],"award-info":[{"award-number":["21H03398"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,6]]},"abstract":"Abstract<\/jats:title>We consider primal-dual pairs of semidefinite programs and assume that they are singular, i.e., both primal and dual are either weakly feasible or weakly infeasible. Under such circumstances, strong duality may break down and the primal and dual might have a nonzero duality gap. Nevertheless, there are arbitrary small perturbations to the problem data which would make them strongly feasible thus zeroing the duality gap. In this paper, we conduct an asymptotic analysis of the optimal value as the perturbation for regularization is driven to zero. Specifically, we fix two positive definite matrices, $$I_p$$<\/jats:tex-math>\n \n I<\/mml:mi>\n p<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$I_d$$<\/jats:tex-math>\n \n I<\/mml:mi>\n d<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, say, (typically the identity matrices), and regularize the primal and dual problems by shifting their associated affine space by $$\\eta I_p$$<\/jats:tex-math>\n \n \u03b7<\/mml:mi>\n \n I<\/mml:mi>\n p<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$\\varepsilon I_d$$<\/jats:tex-math>\n \n \u03b5<\/mml:mi>\n \n I<\/mml:mi>\n d<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, respectively, to recover interior feasibility of both problems, where $$\\varepsilon $$<\/jats:tex-math>\n \u03b5<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$\\eta $$<\/jats:tex-math>\n \u03b7<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are positive numbers. Then we analyze the behavior of the optimal value of the regularized problem when the perturbation is reduced to zero keeping the ratio between $$\\eta $$<\/jats:tex-math>\n \u03b7<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$\\varepsilon $$<\/jats:tex-math>\n \u03b5<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> constant. A key feature of our analysis is that no further assumptions such as compactness or constraint qualifications are ever made. It will be shown that the optimal value of the perturbed problem converges to a value between the primal and dual optimal values of the original problems. Furthermore, the limiting optimal value changes \u201cmonotonically\u201d from the primal optimal value to the dual optimal value as a function of $$\\theta $$<\/jats:tex-math>\n \u03b8<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, if we parametrize $$(\\varepsilon , \\eta )$$<\/jats:tex-math>\n \n (<\/mml:mo>\n \u03b5<\/mml:mi>\n ,<\/mml:mo>\n \u03b7<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> as $$(\\varepsilon , \\eta )=t(\\cos \\theta , \\sin \\theta )$$<\/jats:tex-math>\n \n (<\/mml:mo>\n \u03b5<\/mml:mi>\n ,<\/mml:mo>\n \u03b7<\/mml:mi>\n )<\/mml:mo>\n =<\/mml:mo>\n t<\/mml:mi>\n (<\/mml:mo>\n cos<\/mml:mo>\n \u03b8<\/mml:mi>\n ,<\/mml:mo>\n sin<\/mml:mo>\n \u03b8<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and let $$t\\rightarrow 0$$<\/jats:tex-math>\n \n t<\/mml:mi>\n \u2192<\/mml:mo>\n 0<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Finally, the analysis leads us to the relatively surprising consequence that some representative infeasible interior-point algorithms for SDP generate sequences converging to a number between the primal and dual optimal values, even in the presence of a nonzero duality gap. Though this result is more of theoretical interest at this point, it might be of some value in the development of infeasible interior-point algorithms that can handle singular problems.<\/jats:p>","DOI":"10.1007\/s10107-022-01891-8","type":"journal-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T16:06:47Z","timestamp":1667837207000},"page":"531-568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms"],"prefix":"10.1007","volume":"200","author":[{"given":"Takashi","family":"Tsuchiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno F.","family":"Louren\u00e7o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakazu","family":"Muramatsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayuki","family":"Okuno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"issue":"2","key":"1891_CR1","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1090\/S0002-9904-1969-12153-1","volume":"75","author":"A Ben-Israel","year":"1969","unstructured":"Ben-Israel, A., Charnes, A., Kortanek, K.O.: Duality and asymptotic solvability over cones. Bull. Am. Math. Soc. 75(2), 318\u2013324 (1969)","journal-title":"Bull. Am. Math. Soc."},{"key":"1891_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03718-8","volume-title":"Real Algebraic Geometry","author":"J Bochnak","year":"1998","unstructured":"Bochnak, J., Coste, M., Roy, M.F.: Real Algebraic Geometry. Springer Science, Berlin (1998)"},{"key":"1891_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer-Verlag, New York (2000)"},{"issue":"03","key":"1891_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S1446788700017250","volume":"30","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Facial reduction for a cone-convex programming problem. J. Aust. Math. Soc. (Ser. A) 30(03), 369\u2013380 (1981)","journal-title":"J. Aust. Math. Soc. (Ser. A)"},{"issue":"2","key":"1891_CR5","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83(2), 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"key":"1891_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, Y.L., Schurr, S., Wolkowicz, H.: Preprocessing and regularization for degenerate semidefinite programs. In: Computational and Analytical Mathematics. Springer Proceedings in Mathematics & Statistics, vol. 50, pp. 251\u2013303. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-7621-4_12"},{"key":"1891_CR7","doi-asserted-by":"crossref","unstructured":"Drusvyatskiy, D., Wolkowicz, H.: The many faces of degeneracy in conic optimization. University of Washington, Tech. rep. (2017)","DOI":"10.1561\/9781680833911"},{"key":"1891_CR8","volume-title":"Linear Inequalities and Related Systems. Annals of Mathematics Studies","author":"RJ Duffin","year":"2000","unstructured":"Duffin, R.J.: Chap. 6: Infinite programs. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems. Annals of Mathematics Studies, vol. 38. Princeton University Press, Princeton (2000)"},{"issue":"6","key":"1891_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.orl.2016.08.004","volume":"44","author":"HA Friberg","year":"2016","unstructured":"Friberg, H.A.: A relaxed-certificate facial reduction algorithm based on subspace intersection. Oper. Res. Lett. 44(6), 718\u2013722 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1891_CR10","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1080\/10556788.2017.1322081","volume":"33","author":"T Gally","year":"2018","unstructured":"Gally, T., Pfetsch, M.E., Ulbrich, S.: A framework for solving mixed-integer semidefinite programs. Optim. Methods Softw. 33(3), 594\u2013632 (2018)","journal-title":"Optim. Methods Softw."},{"key":"1891_CR11","volume-title":"Foundations of Optimization. Graduate Texts in Mathematics","author":"O G\u00fcler","year":"2010","unstructured":"G\u00fcler, O.: Foundations of Optimization. Graduate Texts in Mathematics. Springer, New York (2010)"},{"issue":"2","key":"1891_CR12","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."},{"issue":"1","key":"1891_CR13","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."},{"key":"1891_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-8134-0","volume-title":"A Primer of Real Analytic Functions. Advanced Texts Series","author":"S Krantz","year":"2002","unstructured":"Krantz, S., Parks, H.: A Primer of Real Analytic Functions. Advanced Texts Series. Birkh\u00e4user, Boston (2002)"},{"key":"1891_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1136-5","author":"M Liu","year":"2017","unstructured":"Liu, M., Pataki, G.: Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming. Math. Program. (2017). https:\/\/doi.org\/10.1007\/s10107-017-1136-5","journal-title":"Math. Program."},{"issue":"1","key":"1891_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-018-1265-5","volume":"177","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Ryu, E.K., Yin, W.: A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs. Math. Program. 177(1), 225\u2013253 (2019)","journal-title":"Math. Program."},{"key":"1891_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01439-3","volume":"186","author":"BF Louren\u00e7o","year":"2021","unstructured":"Louren\u00e7o, B.F.: Amenable cones: error bounds without constraint qualifications. Math. Program. 186, 1\u201348 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"1891_CR18","first-page":"241","volume":"59","author":"BF Louren\u00e7o","year":"2016","unstructured":"Louren\u00e7o, B.F., Muramatsu, M., Tsuchiya, T.: A structural geometrical analysis of weakly infeasible SDPs. J. Oper. Res. Soc. Jpn. 59(3), 241\u2013257 (2016)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"3","key":"1891_CR19","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1137\/15M1051634","volume":"28","author":"BF Louren\u00e7o","year":"2018","unstructured":"Louren\u00e7o, B.F., Muramatsu, M., Tsuchiya, T.: Facial reduction and partial polyhedrality. SIAM J. Optim. 28(3), 2304\u20132326 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"1891_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1080\/10556788.2020.1850720","volume":"36","author":"BF Louren\u00e7o","year":"2021","unstructured":"Louren\u00e7o, B.F., Muramatsu, M., Tsuchiya, T.: Solving SDP completely with an interior point oracle. Optim. Methods Softw. 36(2\u20133), 425\u2013471 (2021)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1891_CR21","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/S1052623403430828","volume":"15","author":"Z Lu","year":"2004","unstructured":"Lu, Z., Monteiro, R.D.C.: Error bounds and limiting behavior of weighted paths associated with the SDP map $$X^{1\/2}SX^{1\/2}$$. SIAM J. Optim. 15(2), 348\u2013374 (2004)","journal-title":"SIAM J. Optim."},{"key":"1891_CR22","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications","author":"ZQ Luo","year":"2000","unstructured":"Luo, Z.Q., Sturm, J.F.: Error analysis. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"1891_CR23","unstructured":"Luo, Z.Q., Sturm, J.F., Zhang, S.: Duality and self-duality for conic convex programming. Econometric Institute, Erasmus University Rotterdam, The Netherlands, Tech. rep. (1996)"},{"key":"1891_CR24","unstructured":"Luo, Z.Q., Sturm, J.F., Zhang, S.: Duality results for conic convex programming. Econometric Institute, Erasmus University Rotterdam, The Netherlands, Tech. rep. (1997)"},{"issue":"3","key":"1891_CR25","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RDC Monteiro","year":"1997","unstructured":"Monteiro, R.D.C.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7(3), 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1891_CR26","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/S1052623496312836","volume":"9","author":"RDC Monteiro","year":"1999","unstructured":"Monteiro, R.D.C., Tsuchiya, T.: Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. SIAM J. Optim. 9(3), 551\u2013577 (1999)","journal-title":"SIAM J. Optim."},{"key":"1891_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y Nesterov","year":"1997","unstructured":"Nesterov, Y., Todd, M.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"key":"1891_CR28","doi-asserted-by":"crossref","unstructured":"Pataki, G.: Strong duality in conic linear programming: facial reduction and extended duals. In: Computational and Analytical Mathematics, vol.\u00a050, pp. 613\u2013634. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-7621-4_28"},{"issue":"1","key":"1891_CR29","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/15M1041924","volume":"27","author":"G Pataki","year":"2017","unstructured":"Pataki, G.: Bad semidefinite programs: they all look the same. SIAM J. Optim. 27(1), 146\u2013172 (2017)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1891_CR30","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1137\/15M1049415","volume":"27","author":"F Permenter","year":"2017","unstructured":"Permenter, F., Friberg, H.A., Andersen, E.D.: Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. SIAM J. Optim. 27(3), 1257\u20131282 (2017)","journal-title":"SIAM J. Optim."},{"key":"1891_CR31","doi-asserted-by":"publisher","unstructured":"Permenter, F., Parrilo, P.: Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone. Math. Program. 171,1\u201354 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1169-9","DOI":"10.1007\/s10107-017-1169-9"},{"key":"1891_CR32","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/S1052623495294955","volume":"8","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8, 1007\u20131028 (1998)","journal-title":"SIAM J. Optim."},{"key":"1891_CR33","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10107-003-0463-x","volume":"99","author":"M Prei\u00df","year":"2004","unstructured":"Prei\u00df, M., Stoer, J.: Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems. Math. Program. 99, 499\u2013520 (2004)","journal-title":"Math. Program."},{"key":"1891_CR34","doi-asserted-by":"crossref","unstructured":"Ramana, M.V.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program. 77, 129\u2013162 (1995)","DOI":"10.1007\/BF02614433"},{"issue":"3","key":"1891_CR35","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"MV Ramana","year":"1997","unstructured":"Ramana, M.V., Tun\u00e7el, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7(3), 641\u2013662 (1997)","journal-title":"SIAM J. Optim."},{"key":"1891_CR36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718812","volume-title":"A Mathematical View of Interior-Point Methods in Convex Optimization","author":"J Renegar","year":"2001","unstructured":"Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. SIAM, Philadelphia (2001)"},{"key":"1891_CR37","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. No. 16 in Conference Board of Math. Sciences Series. SIAM Publications (1974)","DOI":"10.1137\/1.9781611970524"},{"key":"1891_CR38","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)"},{"issue":"1","key":"1891_CR39","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10957-020-01780-0","volume":"188","author":"Y Sekiguchi","year":"2021","unstructured":"Sekiguchi, Y., Waki, H.: Perturbation analysis of singular semidefinite program and its application to a control problem. J. Optim. Theory Appl. 188(1), 52\u201372 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"1891_CR40","unstructured":"Sremac, S., Woerdeman, H., Wolkowicz, H.: Complete facial reduction in one step for spectrahedra. arXiv e-prints: arXiv:1710.07410 (2017)"},{"issue":"1","key":"1891_CR41","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1137\/19M1289327","volume":"31","author":"S Sremac","year":"2021","unstructured":"Sremac, S., Woerdeman, H.J., Wolkowicz, H.: Error bounds and singularity degree in semidefinite programming. SIAM J. Optim. 31(1), 812\u2013836 (2021)","journal-title":"SIAM J. Optim."},{"key":"1891_CR42","first-page":"1","volume-title":"High Performance Optimization","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Theory and algorithms of semidefinite programming. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization, pp. 1\u2013194. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"4","key":"1891_CR43","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1137\/S1052623498338606","volume":"10","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Error bounds for linear matrix inequalities. SIAM J. Optim. 10(4), 1228\u20131248 (2000). https:\/\/doi.org\/10.1137\/S1052623498338606","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1891_CR44","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":"1891_CR45","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2014a matlab software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1891_CR46","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s10957-012-0219-y","volume":"158","author":"H Waki","year":"2013","unstructured":"Waki, H., Muramatsu, M.: Facial reduction algorithms for conic optimization problems. J. Optim. Theory Appl. 158(1), 188\u2013215 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1891_CR47","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1080\/1055678031000118482","volume":"18","author":"M Yamashita","year":"2003","unstructured":"Yamashita, M., Fujisawa, K., Kojima, M.: Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0). Optim. Methods Softw. 18, 491\u2013505 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1891_CR48","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":"3","key":"1891_CR49","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s12532-019-00164-4","volume":"11","author":"YM Zhu","year":"2019","unstructured":"Zhu, Y.M., Pataki, G., Tran-Dinh, Q.: Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs. Math. Program. Comput. 11(3), 503\u2013586 (2019)","journal-title":"Math. Program. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01891-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01891-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01891-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T23:09:41Z","timestamp":1684451381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01891-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1891"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01891-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"27 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}