TY - JOUR AU - Lovász, L. PY - 1979 DA - 1979// TI - On the Shannon capacity of a graph JO - IEEE Trans. Inf. Theory VL - 25 ID - Lovász1979 ER - TY - JOUR AU - Goemans, M. X. AU - Williamson, D. P. PY - 1995 DA - 1995// TI - Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming JO - J. ACM VL - 42 ID - Goemans1995 ER - TY - JOUR AU - Sherali, H. D. AU - Adams, W. P. PY - 1990 DA - 1990// TI - A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems JO - SIAM J. Discrete Math. VL - 3 ID - Sherali1990 ER - TY - JOUR AU - Lovász, L. AU - Schrijver, A. PY - 1991 DA - 1991// TI - Cones of matrices and set-functions and 0–1 optimization JO - SIAM J. Optim. VL - 1 ID - Lovász1991 ER - TY - STD TI - Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 293–303, Springer, Berlin (2001) ID - ref5 ER - TY - JOUR AU - Laurent, M. PY - 2003 DA - 2003// TI - A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0–1 programming JO - Math. Oper. Res. VL - 28 ID - Laurent2003 ER - TY - JOUR AU - Lasserre, J. B. PY - 2001 DA - 2001// TI - Global optimization with polynomials and the problem of moments JO - SIAM J. Optim. VL - 11 ID - Lasserre2001 ER - TY - STD TI - Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology (2000) ID - ref8 ER - TY - BOOK AU - Nesterov, Y. PY - 2013 DA - 2013// TI - Introductory Lectures on Convex Optimization: A Basic Course PB - Springer CY - Berlin ID - Nesterov2013 ER - TY - JOUR AU - Fukuda, M. AU - Kojima, M. AU - Murota, K. AU - Nakata, K. PY - 2001 DA - 2001// TI - Exploiting sparsity in semidefinite programming via matrix completion I: general framework JO - SIAM J. Optim. VL - 11 ID - Fukuda2001 ER - TY - JOUR AU - Molzahn, D. K. AU - Holzer, J. T. AU - Lesieutre, B. C. AU - DeMarco, C. L. PY - 2013 DA - 2013// TI - Implementation of a large-scale optimal power flow solver based on semidefinite programming JO - IEEE Trans. Power Syst. VL - 28 ID - Molzahn2013 ER - TY - JOUR AU - Madani, R. AU - Sojoudi, S. AU - Lavaei, J. PY - 2015 DA - 2015// TI - Convex relaxation for optimal power flow problem: Mesh networks JO - IEEE Trans. Power Syst. VL - 30 ID - Madani2015 ER - TY - JOUR AU - Madani, R. AU - Ashraphijuo, M. AU - Lavaei, J. PY - 2016 DA - 2016// TI - Promises of conic relaxation for contingency-constrained optimal power flow problem JO - IEEE Trans. Power Syst. VL - 31 ID - Madani2016 ER - TY - JOUR AU - Eltved, A. AU - Dahl, J. AU - Andersen, M. S. PY - 2020 DA - 2020// TI - On the robustness and scalability of semidefinite relaxation for optimal power flow problems JO - Optim. Eng. VL - 21 UR - https://doi.org/10.1007/s11081-019-09427-4 DO - 10.1007/s11081-019-09427-4 ID - Eltved2020 ER - TY - JOUR AU - Vandenberghe, L. AU - Andersen, M. S. PY - 2015 DA - 2015// TI - Chordal graphs and semidefinite optimization JO - Found. Trends Optim. VL - 1 ID - Vandenberghe2015 ER - TY - JOUR AU - Sun, Y. AU - Andersen, M. S. AU - Vandenberghe, L. PY - 2014 DA - 2014// TI - Decomposition in conic optimization with partially separable structure JO - SIAM J. Optim. VL - 24 ID - Sun2014 ER - TY - JOUR AU - Andersen, M. S. AU - Hansson, A. AU - Vandenberghe, L. PY - 2014 DA - 2014// TI - Reduced-complexity semidefinite relaxations of optimal power flow problems JO - IEEE Trans. Power Syst. VL - 29 ID - Andersen2014 ER - TY - JOUR AU - Löfberg, J. PY - 2009 DA - 2009// TI - Dualize it: software for automatic primal and dual conversions of conic programs JO - Optim. Methods Softw. VL - 24 ID - Löfberg2009 ER - TY - JOUR AU - Griewank, A. AU - Toint, P. L. PY - 1982 DA - 1982// TI - Partitioned variable metric updates for large structured optimization problems JO - Numerische Mathematik VL - 39 ID - Griewank1982 ER - TY - STD TI - Andersen, M., Dahl, J., Vandenberghe, L.: CVXOPT: A Python package for convex optimization. abel.ee.ucla.edu/cvxopt. (2013) ID - ref20 ER - TY - STD TI - Löfberg, J.: Yalmip: A toolbox for modeling and optimization in matlab. In: Proceedings of the CACSD Conference, 3. Taipei, Taiwan (2004) ID - ref21 ER - TY - STD TI - Fujisawa, K., Kim, S., Kojima, M., Okamoto, Y., Yamashita, M.: User’s 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 ID - ref22 ER - TY - JOUR AU - Kim, S. AU - Kojima, M. AU - Mevissen, M. AU - Yamashita, M. PY - 2011 DA - 2011// TI - Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion JO - Math. Program. VL - 129 ID - Kim2011 ER - TY - STD TI - Andersen, M.S.: Opfsdr v0.2.3 (2018) ID - ref24 ER - TY - STD TI - 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. 5932–5939. IEEE (2015) ID - ref25 ER - TY - STD TI - Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Chordal decomposition in operator-splitting methods for sparse semidefinite programs. Math. Program. 180, 489–532 (2020). https://doi.org/10.1007/s10107-019-01366-3 ID - ref26 ER - TY - STD TI - 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) UR - http://arxiv.org/abs/1406.2192 ID - ref27 ER - TY - JOUR AU - Khoshfetrat Pakazad, S. AU - Hansson, A. AU - Andersen, M. S. PY - 2014 DA - 2014// TI - Distributed interior-point method for loosely coupled problems JO - IFAC Proc. Volumes VL - 47 ID - Khoshfetrat Pakazad2014 ER - TY - JOUR AU - Zhang, R. Y. AU - White, J. K. PY - 2018 DA - 2018// TI - Gmres-accelerated ADMM for quadratic objectives JO - SIAM J. Optim. VL - 28 ID - Zhang2018 ER - TY - JOUR AU - Andersen, M. S. AU - Dahl, J. AU - Vandenberghe, L. PY - 2010 DA - 2010// TI - Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones JO - Math. Program. Comput. VL - 2 ID - Andersen2010 ER - TY - JOUR AU - Duff, I. S. AU - Reid, J. K. PY - 1983 DA - 1983// TI - The multifrontal solution of indefinite sparse symmetric linear JO - ACM Trans. Math. Softw. (TOMS) VL - 9 ID - Duff1983 ER - TY - JOUR AU - Liu, J. W. PY - 1992 DA - 1992// TI - The multifrontal method for sparse matrix solution: theory and practice JO - SIAM Rev. VL - 34 ID - Liu1992 ER - TY - JOUR AU - Pakazad, S. K. h. o. s. h. f. e. t. r. a. t. AU - Hansson, A. AU - Andersen, M. S. AU - Nielsen, I. PY - 2017 DA - 2017// TI - Distributed primal-dual interior-point methods for solving tree-structured coupled convex problems using message-passing JO - Optim. Methods Softw. VL - 32 ID - Pakazad2017 ER - TY - JOUR AU - Khoshfetrat Pakazad, S. AU - Hansson, A. AU - Andersen, M. S. AU - Rantzer, A. PY - 2017 DA - 2017// TI - Distributed semidefinite programming with application to large-scale system analysis JO - IEEE Trans. Autom. Control VL - 63 ID - Khoshfetrat Pakazad2017 ER - TY - JOUR AU - Alizadeh, F. AU - Haeberly, J. -. P. A. AU - Overton, M. L. PY - 1997 DA - 1997// TI - Complementarity and nondegeneracy in semidefinite programming JO - Math. Program. VL - 77 ID - Alizadeh1997 ER - TY - JOUR AU - Arnborg, S. AU - Corneil, D. G. AU - Proskurowski, A. PY - 1987 DA - 1987// TI - Complexity of finding embeddings in a k-tree JO - SIAM J. Algebraic Discrete Methods VL - 8 ID - Arnborg1987 ER - TY - JOUR AU - Ye, Y. AU - Todd, M. J. AU - Mizuno, S. PY - 1994 DA - 1994// TI - An $$O(\sqrt{nL})$$O(nL)-iteration homogeneous and self-dual linear programming algorithm JO - Math. Oper. Res. VL - 19 ID - Ye1994 ER - TY - STD TI - Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Springer Science & Business Media (2012) ID - ref38 ER - TY - JOUR AU - Permenter, F. AU - Friberg, H. A. AU - Andersen, E. D. PY - 2017 DA - 2017// TI - Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach JO - SIAM J. Optim. VL - 27 ID - Permenter2017 ER - TY - JOUR AU - Frieze, A. AU - Jerrum, M. PY - 1997 DA - 1997// TI - Improved approximation algorithms for MAX k-CUT and MAX BISECTION JO - Algorithmica VL - 18 ID - Frieze1997 ER - TY - STD TI - 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) ID - ref41 ER - TY - JOUR AU - Borchers, B. PY - 1999 DA - 1999// TI - Sdplib 1.2, a library of semidefinite programming test problems JO - Optim. Methods Softw. VL - 11 ID - Borchers1999 ER - TY - STD TI - Sun, Y.: Decomposition methods for semidefinite optimization. Ph.D. thesis, UCLA (2015) ID - ref43 ER - TY - JOUR AU - Liu, J. W. PY - 1990 DA - 1990// TI - The role of elimination trees in sparse factorization JO - SIAM J. Matrix Anal. Appl. VL - 11 ID - Liu1990 ER - TY - JOUR AU - Bodlaender, H. L. AU - Gilbert, J. R. AU - Hafsteinsson, H. AU - Kloks, T. PY - 1995 DA - 1995// TI - Approximating treewidth, pathwidth, frontsize, and shortest elimination tree JO - J. Algorithms VL - 18 ID - Bodlaender1995 ER - TY - STD TI - 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. 422–431. IEEE (1988) ID - ref46 ER - TY - STD TI - 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. 310–321. ACM (1990) ID - ref47 ER - TY - JOUR AU - George, A. AU - Liu, J. W. PY - 1989 DA - 1989// TI - The evolution of the minimum degree ordering algorithm JO - SIAM Rev. VL - 31 ID - George1989 ER - TY - JOUR AU - Lipton, R. J. AU - Rose, D. J. AU - Tarjan, R. E. PY - 1979 DA - 1979// TI - Generalized nested dissection JO - SIAM J. Numer. Anal. VL - 16 ID - Lipton1979 ER - TY - JOUR AU - Rose, D. J. AU - Tarjan, R. E. AU - Lueker, G. S. PY - 1976 DA - 1976// TI - Algorithmic aspects of vertex elimination on graphs JO - SIAM J. Comput. VL - 5 ID - Rose1976 ER - TY - BOOK AU - George, A. AU - Liu, J. W. PY - 1981 DA - 1981// TI - Computer Solution of Large Sparse Positive Definite Systems PB - Prentice Hall CY - Englewood Cliffs, NJ ID - George1981 ER - TY - JOUR AU - Grone, R. AU - Johnson, C. R. AU - Sá, E. M. AU - Wolkowicz, H. PY - 1984 DA - 1984// TI - Positive definite completions of partial Hermitian matrices JO - Linear Algebra Appl. VL - 58 ID - Grone1984 ER - TY - JOUR AU - Dancis, J. PY - 1992 DA - 1992// TI - Positive semidefinite completions of partial hermitian matrices JO - Linear Algebra Appl. VL - 175 ID - Dancis1992 ER - TY - JOUR AU - Laurent, M. AU - Varvitsiotis, A. PY - 2014 DA - 2014// TI - A new graph parameter related to bounded rank positive semidefinite matrix completions JO - Math. Program. VL - 145 ID - Laurent2014 ER - TY - JOUR AU - Madani, R. AU - Sojoudi, S. AU - Fazelnia, G. AU - Lavaei, J. PY - 2017 DA - 2017// TI - Finding low-rank solutions of sparse linear matrix inequalities using convex optimization JO - SIAM J. Optim. VL - 27 ID - Madani2017 ER - TY - STD TI - Jiang, X.: Minimum rank positive semidefinite matrix completion with chordal sparsity pattern. Master’s thesis, UCLA (2017) ID - ref56 ER - TY - JOUR AU - Kobayashi, K. AU - Kim, S. AU - Kojima, M. PY - 2008 DA - 2008// TI - Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP JO - Appl. Math. Optim. VL - 58 ID - Kobayashi2008 ER - TY - JOUR AU - Parter, S. PY - 1961 DA - 1961// TI - The use of linear graphs in Gauss elimination JO - SIAM Rev. VL - 3 ID - Parter1961 ER - TY - JOUR AU - Sturm, J. F. PY - 1999 DA - 1999// TI - Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones JO - Optim. Methods Softw. VL - 11 ID - Sturm1999 ER - TY - STD TI - 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) ID - ref60 ER - TY - JOUR AU - Sturm, J. F. PY - 2002 DA - 2002// TI - Implementation of interior point methods for mixed semidefinite and second order cone optimization problems JO - Optim. Methods Softw. VL - 17 ID - Sturm2002 ER - TY - JOUR AU - Andersen, E. D. AU - Roos, C. AU - Terlaky, T. PY - 2003 DA - 2003// TI - On implementing a primal-dual interior-point method for conic quadratic optimization JO - Math. Program. VL - 95 ID - Andersen2003 ER - TY - JOUR AU - Goldfarb, D. AU - Scheinberg, K. PY - 2005 DA - 2005// TI - Product-form Cholesky factorization in interior point methods for second-order cone programming JO - Math. Program. VL - 103 ID - Goldfarb2005 ER - TY - JOUR AU - Guo, J. AU - Niedermeier, R. PY - 2006 DA - 2006// TI - Exact algorithms and applications for Tree-like Weighted Set Cover JO - J. Discrete Algorithms VL - 4 ID - Guo2006 ER - TY - JOUR AU - Lewis, J. G. AU - Peyton, B. W. AU - Pothen, A. PY - 1989 DA - 1989// TI - A fast algorithm for reordering sparse matrices for parallel factorization JO - SIAM J. Sci. Stat. Comput. VL - 10 ID - Lewis1989 ER - TY - STD TI - 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–204. SIAM (1990) ID - ref66 ER - TY - JOUR AU - Andersen, M. S. AU - Dahl, J. AU - Vandenberghe, L. PY - 2013 DA - 2013// TI - Logarithmic barriers for sparse matrix cones JO - Optim. Methods Softw. VL - 28 ID - Andersen2013 ER - TY - STD TI - George, A., Gilbert, J.R., Liu, J.W.H. (eds.): Graph Theory and Sparse Matrix Computation. Springer Science & Business Media (2012) ID - ref68 ER - TY - JOUR AU - Zimmerman, R. D. AU - Murillo-Sánchez, C. E. AU - Thomas, R. J. PY - 2011 DA - 2011// TI - MATPOWER: Steady-state operations, planning, and analysis tools for power systems research and education JO - IEEE Trans. Power Syst. VL - 26 ID - Zimmerman2011 ER - TY - STD TI - 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) UR - http://arxiv.org/abs/1603.01533 ID - ref70 ER - TY - JOUR AU - Mittelmann, H. D. PY - 2003 DA - 2003// TI - An independent benchmarking of SDP and SOCP solvers JO - Math. Program. VL - 95 ID - Mittelmann2003 ER - TY - STD TI - Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.): High Performance Optimiztion. Springer Science & Business Media (2013) ID - ref72 ER - TY - JOUR AU - Amestoy, P. R. AU - Davis, T. A. AU - Duff, I. S. PY - 2004 DA - 2004// TI - Algorithm 837: AMD, an approximate minimum degree ordering algorithm JO - ACM Trans. Math. Softw. (TOMS) VL - 30 ID - Amestoy2004 ER - TY - JOUR AU - Lavaei, J. AU - Low, S. H. PY - 2012 DA - 2012// TI - Zero duality gap in optimal power flow problem JO - IEEE Trans. Power Syst. VL - 27 ID - Lavaei2012 ER - TY - JOUR AU - Nakata, K. AU - Fujisawa, K. AU - Fukuda, M. AU - Kojima, M. AU - Murota, K. PY - 2003 DA - 2003// TI - Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results JO - Math. Program. VL - 95 ID - Nakata2003 ER - TY - JOUR AU - Agler, J. AU - Helton, W. AU - McCullough, S. AU - Rodman, L. PY - 1988 DA - 1988// TI - Positive semidefinite matrices with a given sparsity pattern JO - Linear Algebra Appl. VL - 107 ID - Agler1988 ER - TY - BOOK AU - Vanderbei, R. J. PY - 2015 DA - 2015// TI - Linear Programming: Foundations and Extensions PB - Springer CY - Berlin ID - Vanderbei2015 ER - TY - JOUR AU - Nesterov, Y. E. AU - Todd, M. J. PY - 1998 DA - 1998// TI - Primal-dual interior-point methods for self-scaled cones JO - SIAM J. Optim. VL - 8 ID - Nesterov1998 ER - TY - JOUR AU - Sturm, J. F. AU - Zhang, S. PY - 1999 DA - 1999// TI - Symmetric primal-dual path-following algorithms for semidefinite programming JO - Appl. Numer. Math. VL - 29 ID - Sturm1999 ER - TY - JOUR AU - Sturm, J. F. AU - Zhang, S. PY - 1997 DA - 1997// TI - On a wide region of centers and primal-dual interior point algorithms for linear programming JO - Math. Oper. Res. VL - 22 ID - Sturm1997 ER - TY - JOUR AU - Todd, M. J. AU - Toh, K. -. C. AU - Tütüncü, R. H. PY - 1998 DA - 1998// TI - On the nesterov-todd direction in semidefinite programming JO - SIAM J. Optim. VL - 8 ID - Todd1998 ER - TY - JOUR AU - Alizadeh, F. AU - Haeberly, J. -. P. A. AU - Overton, M. L. PY - 1998 DA - 1998// TI - Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results JO - SIAM J. Optim. VL - 8 ID - Alizadeh1998 ER -