{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:31:29Z","timestamp":1770276689690,"version":"3.49.0"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10107-020-01516-y","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T14:02:52Z","timestamp":1590415372000},"page":"351-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion"],"prefix":"10.1007","volume":"188","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3980-2791","authenticated-orcid":false,"given":"Richard Y.","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4294-1338","authenticated-orcid":false,"given":"Javad","family":"Lavaei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,25]]},"reference":[{"issue":"1","key":"1516_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1516_CR2","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"1516_CR3","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1516_CR4","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"1516_CR5","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: International Conference on Integer Programming and Combinatorial Optimization, pp.\u00a0293\u2013303, Springer, Berlin (2001)","DOI":"10.1007\/3-540-45535-3_23"},{"issue":"3","key":"1516_CR6","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1516_CR7","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1516_CR8","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology (2000)"},{"key":"1516_CR9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, Berlin (2013)"},{"issue":"3","key":"1516_CR10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2001","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11(3), 647\u2013674 (2001)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1516_CR11","doi-asserted-by":"crossref","first-page":"3987","DOI":"10.1109\/TPWRS.2013.2258044","volume":"28","author":"DK Molzahn","year":"2013","unstructured":"Molzahn, D.K., Holzer, J.T., Lesieutre, B.C., DeMarco, C.L.: Implementation of a large-scale optimal power flow solver based on semidefinite programming. IEEE Trans. Power Syst. 28(4), 3987\u20133998 (2013)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"1516_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TPWRS.2014.2322051","volume":"30","author":"R Madani","year":"2015","unstructured":"Madani, R., Sojoudi, S., Lavaei, J.: Convex relaxation for optimal power flow problem: Mesh networks. IEEE Trans. Power Syst. 30(1), 199\u2013211 (2015)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"1516_CR13","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1109\/TPWRS.2015.2411391","volume":"31","author":"R Madani","year":"2016","unstructured":"Madani, R., Ashraphijuo, M., Lavaei, J.: Promises of conic relaxation for contingency-constrained optimal power flow problem. IEEE Trans. Power Syst. 31(2), 1297\u20131307 (2016)","journal-title":"IEEE Trans. Power Syst."},{"key":"1516_CR14","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s11081-019-09427-4","volume":"21","author":"A Eltved","year":"2020","unstructured":"Eltved, A., Dahl, J., Andersen, M.S.: On the robustness and scalability of semidefinite relaxation for optimal power flow problems. Optim. Eng. 21, 375\u2013392 (2020). https:\/\/doi.org\/10.1007\/s11081-019-09427-4","journal-title":"Optim. Eng."},{"issue":"4","key":"1516_CR15","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"L Vandenberghe","year":"2015","unstructured":"Vandenberghe, L., Andersen, M.S., et al.: Chordal graphs and semidefinite optimization. Found. Trends Optim. 1(4), 241\u2013433 (2015)","journal-title":"Found. Trends Optim."},{"issue":"2","key":"1516_CR16","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/130926924","volume":"24","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Andersen, M.S., Vandenberghe, L.: Decomposition in conic optimization with partially separable structure. SIAM J. Optim. 24(2), 873\u2013897 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1516_CR17","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1109\/TPWRS.2013.2294479","volume":"29","author":"MS Andersen","year":"2014","unstructured":"Andersen, M.S., Hansson, A., Vandenberghe, L.: Reduced-complexity semidefinite relaxations of optimal power flow problems. IEEE Trans. Power Syst. 29(4), 1855\u20131863 (2014)","journal-title":"IEEE Trans. Power Syst."},{"issue":"3","key":"1516_CR18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1080\/10556780802553325","volume":"24","author":"J L\u00f6fberg","year":"2009","unstructured":"L\u00f6fberg, J.: Dualize it: software for automatic primal and dual conversions of conic programs. Optim. Methods Softw. 24(3), 313\u2013325 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1516_CR19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01399316","volume":"39","author":"A Griewank","year":"1982","unstructured":"Griewank, A., Toint, P.L.: Partitioned variable metric updates for large structured optimization problems. Numerische Mathematik 39(1), 119\u2013137 (1982)","journal-title":"Numerische Mathematik"},{"key":"1516_CR20","unstructured":"Andersen, M., Dahl, J., Vandenberghe, L.: CVXOPT: A Python package for convex optimization. abel.ee.ucla.edu\/cvxopt. (2013)"},{"key":"1516_CR21","unstructured":"L\u00f6fberg, J.: Yalmip: A toolbox for modeling and optimization in matlab. In: Proceedings of the CACSD Conference, 3. Taipei, Taiwan (2004)"},{"key":"1516_CR22","unstructured":"Fujisawa, K., Kim, S., Kojima, M., Okamoto, Y., Yamashita, M.: User\u2019s manual for SparseCoLO: Conversion methods for sparse conic-form linear optimization problems. Technical report, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, (2009). Research Report B-453"},{"issue":"1","key":"1516_CR23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-010-0402-6","volume":"129","author":"S Kim","year":"2011","unstructured":"Kim, S., Kojima, M., Mevissen, M., Yamashita, M.: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129(1), 33\u201368 (2011)","journal-title":"Math. Program."},{"key":"1516_CR24","unstructured":"Andersen, M.S.: Opfsdr v0.2.3 (2018)"},{"key":"1516_CR25","doi-asserted-by":"crossref","unstructured":"Madani, R., Kalbat, A., Lavaei, J.: ADMM for sparse semidefinite programming with applications to optimal power flow problem. In: IEEE 54th Annual Conference on Decision and Control (CDC), pp.\u00a05932\u20135939. IEEE (2015)","DOI":"10.1109\/CDC.2015.7403152"},{"key":"1516_CR26","doi-asserted-by":"publisher","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Chordal decomposition in operator-splitting methods for sparse semidefinite programs. Math. Program. 180, 489\u2013532 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01366-3","DOI":"10.1007\/s10107-019-01366-3"},{"key":"1516_CR27","doi-asserted-by":"crossref","unstructured":"Annergren, M., Pakazad, S.K., Hansson, A., Wahlberg, B.: A distributed primal-dual interior-point method for loosely coupled problems using ADMM. arXiv preprint arXiv:1406.2192 (2014)","DOI":"10.3182\/20140824-6-ZA-1003.01647"},{"issue":"3","key":"1516_CR28","doi-asserted-by":"crossref","first-page":"9587","DOI":"10.3182\/20140824-6-ZA-1003.01647","volume":"47","author":"S Khoshfetrat Pakazad","year":"2014","unstructured":"Khoshfetrat Pakazad, S., Hansson, A., Andersen, M.S.: Distributed interior-point method for loosely coupled problems. IFAC Proc. Volumes 47(3), 9587\u20139592 (2014)","journal-title":"IFAC Proc. Volumes"},{"issue":"4","key":"1516_CR29","doi-asserted-by":"crossref","first-page":"3025","DOI":"10.1137\/16M1059941","volume":"28","author":"RY Zhang","year":"2018","unstructured":"Zhang, R.Y., White, J.K.: Gmres-accelerated ADMM for quadratic objectives. SIAM J. Optim. 28(4), 3025\u20133056 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1516_CR30","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s12532-010-0016-2","volume":"2","author":"MS Andersen","year":"2010","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones. Math. Program. Comput. 2(3), 167\u2013201 (2010)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1516_CR31","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear. ACM Trans. Math. Softw. (TOMS) 9(3), 302\u2013325 (1983)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"1516_CR32","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/1034004","volume":"34","author":"JW Liu","year":"1992","unstructured":"Liu, J.W.: The multifrontal method for sparse matrix solution: theory and practice. SIAM Rev. 34(1), 82\u2013109 (1992)","journal-title":"SIAM Rev."},{"issue":"3","key":"1516_CR33","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/10556788.2016.1213839","volume":"32","author":"S Khoshfetrat Pakazad","year":"2017","unstructured":"Pakazad, S.Khoshfetrat, Hansson, A., Andersen, M.S., Nielsen, I.: Distributed primal-dual interior-point methods for solving tree-structured coupled convex problems using message-passing. Optim. Methods Softw. 32(3), 401\u2013435 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1516_CR34","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1109\/TAC.2017.2739644","volume":"63","author":"S Khoshfetrat Pakazad","year":"2017","unstructured":"Khoshfetrat Pakazad, S., Hansson, A., Andersen, M.S., Rantzer, A.: Distributed semidefinite programming with application to large-scale system analysis. IEEE Trans. Autom. Control 63(4), 1045\u20131058 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1516_CR35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02614432","volume":"77","author":"F Alizadeh","year":"1997","unstructured":"Alizadeh, F., Haeberly, J.-P.A., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77(1), 111\u2013128 (1997)","journal-title":"Math. Program."},{"issue":"2","key":"1516_CR36","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"1516_CR37","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $$O(\\sqrt{nL})$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."},{"key":"1516_CR38","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Springer Science & Business Media (2012)"},{"issue":"3","key":"1516_CR39","doi-asserted-by":"crossref","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."},{"issue":"1","key":"1516_CR40","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18(1), 67\u201381 (1997)","journal-title":"Algorithmica"},{"key":"1516_CR41","unstructured":"Pataki, G., Stefan S.: The DIMACS library of semidefinite-quadratic-linear programs. Technical Report. Preliminary draft, Computational Optimization Research Center, Columbia University, New York (2002)"},{"issue":"1\u20134","key":"1516_CR42","doi-asserted-by":"crossref","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."},{"key":"1516_CR43","unstructured":"Sun, Y.: Decomposition methods for semidefinite optimization. Ph.D. thesis, UCLA (2015)"},{"issue":"1","key":"1516_CR44","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"JW Liu","year":"1990","unstructured":"Liu, J.W.: The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11(1), 134\u2013172 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1516_CR45","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms 18(2), 238\u2013255 (1995)","journal-title":"J. Algorithms"},{"key":"1516_CR46","doi-asserted-by":"crossref","unstructured":"Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pp.\u00a0422\u2013431. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21958"},{"key":"1516_CR47","doi-asserted-by":"crossref","unstructured":"Klein, P., Stein, C., Tardos, E.: Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities. In: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pp.\u00a0310\u2013321. ACM (1990)","DOI":"10.1145\/100216.100257"},{"issue":"1","key":"1516_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A George","year":"1989","unstructured":"George, A., Liu, J.W.: The evolution of the minimum degree ordering algorithm. SIAM Rev. 31(1), 1\u201319 (1989)","journal-title":"SIAM Rev."},{"issue":"2","key":"1516_CR49","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16(2), 346\u2013358 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"1516_CR50","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"1516_CR51","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A George","year":"1981","unstructured":"George, A., Liu, J.W.: Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall, Englewood Cliffs, NJ (1981)"},{"key":"1516_CR52","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"key":"1516_CR53","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0024-3795(92)90304-S","volume":"175","author":"J Dancis","year":"1992","unstructured":"Dancis, J.: Positive semidefinite completions of partial hermitian matrices. Linear Algebra Appl. 175, 97\u2013114 (1992)","journal-title":"Linear Algebra Appl."},{"issue":"1\u20132","key":"1516_CR54","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10107-013-0648-x","volume":"145","author":"M Laurent","year":"2014","unstructured":"Laurent, M., Varvitsiotis, A.: A new graph parameter related to bounded rank positive semidefinite matrix completions. Math. Program. 145(1\u20132), 291\u2013325 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1516_CR55","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/14099379X","volume":"27","author":"R Madani","year":"2017","unstructured":"Madani, R., Sojoudi, S., Fazelnia, G., Lavaei, J.: Finding low-rank solutions of sparse linear matrix inequalities using convex optimization. SIAM J. Optim. 27(2), 725\u2013758 (2017)","journal-title":"SIAM J. Optim."},{"key":"1516_CR56","unstructured":"Jiang, X.: Minimum rank positive semidefinite matrix completion with chordal sparsity pattern. Master\u2019s thesis, UCLA (2017)"},{"issue":"1","key":"1516_CR57","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00245-007-9030-9","volume":"58","author":"K Kobayashi","year":"2008","unstructured":"Kobayashi, K., Kim, S., Kojima, M.: Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP. Appl. Math. Optim. 58(1), 69\u201388 (2008)","journal-title":"Appl. Math. Optim."},{"issue":"2","key":"1516_CR58","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/1003021","volume":"3","author":"S Parter","year":"1961","unstructured":"Parter, S.: The use of linear graphs in Gauss elimination. SIAM Rev. 3(2), 119\u2013130 (1961)","journal-title":"SIAM Rev."},{"issue":"1\u20134","key":"1516_CR59","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","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(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1516_CR60","unstructured":"Andersen, E.D.: Handling free variables in primal-dual interior-point methods using a quadratic cone. In: Proceedings of the SIAM Conference on Optimization, Toronto (2002)"},{"issue":"6","key":"1516_CR61","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1080\/1055678021000045123","volume":"17","author":"JF Sturm","year":"2002","unstructured":"Sturm, J.F.: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim. Methods Softw. 17(6), 1105\u20131154 (2002)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1516_CR62","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-002-0349-3","volume":"95","author":"ED Andersen","year":"2003","unstructured":"Andersen, E.D., Roos, C., Terlaky, T.: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95(2), 249\u2013277 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1516_CR63","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10107-004-0556-1","volume":"103","author":"D Goldfarb","year":"2005","unstructured":"Goldfarb, D., Scheinberg, K.: Product-form Cholesky factorization in interior point methods for second-order cone programming. Math. Program. 103(1), 153\u2013179 (2005)","journal-title":"Math. Program."},{"issue":"4","key":"1516_CR64","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.jda.2005.07.005","volume":"4","author":"J Guo","year":"2006","unstructured":"Guo, J., Niedermeier, R.: Exact algorithms and applications for Tree-like Weighted Set Cover. J. Discrete Algorithms 4(4), 608\u2013622 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"6","key":"1516_CR65","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1137\/0910070","volume":"10","author":"JG Lewis","year":"1989","unstructured":"Lewis, J.G., Peyton, B.W., Pothen, A.: A fast algorithm for reordering sparse matrices for parallel factorization. SIAM J. Sci. Stat. Comput. 10(6), 1146\u20131173 (1989)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"1516_CR66","unstructured":"Pothen, A., Sun, C.: Compact clique tree data structures in sparse matrix factorizations. In: Coleman, T.F., Li, Y. (eds.) Large-Scale Numerical Optimization, pp. 180\u2013204. SIAM (1990)"},{"issue":"3","key":"1516_CR67","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1080\/10556788.2012.684353","volume":"28","author":"MS Andersen","year":"2013","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: Logarithmic barriers for sparse matrix cones. Optim. Methods Softw. 28(3), 396\u2013423 (2013)","journal-title":"Optim. Methods Softw."},{"key":"1516_CR68","unstructured":"George, A., Gilbert, J.R., Liu, J.W.H. (eds.): Graph Theory and Sparse Matrix Computation. Springer Science & Business Media (2012)"},{"issue":"1","key":"1516_CR69","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","volume":"26","author":"RD Zimmerman","year":"2011","unstructured":"Zimmerman, R.D., Murillo-S\u00e1nchez, C.E., Thomas, R.J.: MATPOWER: Steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26(1), 12\u201319 (2011)","journal-title":"IEEE Trans. Power Syst."},{"key":"1516_CR70","unstructured":"Josz, C., Fliscounakis, S., Maeght, J., Panciatici, P.: AC power flow data in MATPOWER and QCQP format: iTesla, RTE snapshots, and PEGASE. arXiv preprint arXiv:1603.01533 (2016)"},{"issue":"2","key":"1516_CR71","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10107-002-0355-5","volume":"95","author":"HD Mittelmann","year":"2003","unstructured":"Mittelmann, H.D.: An independent benchmarking of SDP and SOCP solvers. Math. Program. 95(2), 407\u2013430 (2003)","journal-title":"Math. Program."},{"key":"1516_CR72","unstructured":"Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.): High Performance Optimiztion. Springer Science & Business Media (2013)"},{"issue":"3","key":"1516_CR73","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1024074.1024081","volume":"30","author":"PR Amestoy","year":"2004","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. (TOMS) 30(3), 381\u2013388 (2004)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"1516_CR74","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TPWRS.2011.2160974","volume":"27","author":"J Lavaei","year":"2012","unstructured":"Lavaei, J., Low, S.H.: Zero duality gap in optimal power flow problem. IEEE Trans. Power Syst. 27(1), 92 (2012)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"1516_CR75","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10107-002-0351-9","volume":"95","author":"K Nakata","year":"2003","unstructured":"Nakata, K., Fujisawa, K., Fukuda, M., Kojima, M., Murota, K.: Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. Math. Program. 95(2), 303\u2013327 (2003)","journal-title":"Math. Program."},{"key":"1516_CR76","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(88)90240-6","volume":"107","author":"J Agler","year":"1988","unstructured":"Agler, J., Helton, W., McCullough, S., Rodman, L.: Positive semidefinite matrices with a given sparsity pattern. Linear Algebra Appl. 107, 101\u2013149 (1988)","journal-title":"Linear Algebra Appl."},{"key":"1516_CR77","volume-title":"Linear Programming: Foundations and Extensions","author":"RJ Vanderbei","year":"2015","unstructured":"Vanderbei, R.J.: Linear Programming: Foundations and Extensions. Springer, Berlin (2015)"},{"issue":"2","key":"1516_CR78","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1516_CR79","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0168-9274(98)00099-3","volume":"29","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F., Zhang, S.: Symmetric primal-dual path-following algorithms for semidefinite programming. Appl. Numer. Math. 29(3), 301\u2013315 (1999)","journal-title":"Appl. Numer. Math."},{"issue":"2","key":"1516_CR80","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/moor.22.2.408","volume":"22","author":"JF Sturm","year":"1997","unstructured":"Sturm, J.F., Zhang, S.: On a wide region of centers and primal-dual interior point algorithms for linear programming. Math. Oper. Res. 22(2), 408\u2013431 (1997)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1516_CR81","doi-asserted-by":"crossref","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-todd direction in semidefinite programming. SIAM J. Optim. 8(3), 769\u2013796 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1516_CR82","doi-asserted-by":"crossref","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."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01516-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01516-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01516-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T15:56:36Z","timestamp":1624377396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01516-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,25]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1516"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01516-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,25]]},"assertion":[{"value":"15 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}