Reduced-complexity semidefinite relaxations of optimal power flow problems

IEEE Transactions on Power Systems

Volumn 29, Issue 4, 2014, Pages 1855-1863

  Andersen, Martin S ^a   Hansson, Anders ^b   Vandenberghe, Lieven ^c  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b LINKÖPING UNIVERSITY   (Sweden)

^c Engineering IV   (United States)

Author keywords

Chordal conversion; optimal power flow; semi definite relaxation

Indexed keywords

ACOUSTIC GENERATORS;

COMPUTATIONAL COSTS; EQUALITY CONSTRAINTS; NUMERICAL RESULTS; OPTIMAL POWER FLOW PROBLEM; OPTIMAL POWER FLOWS; REDUCED-COMPLEXITY; SEMIDEFINITE RELAXATION;

ELECTRIC LOAD FLOW;

EID: 84903315680     PISSN: 08858950     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPWRS.2013.2294479     Document Type: Article

References (31)

1. J. Carpentier, "Contribution à l'étude du dispatching économique," Bulletin de la société française des électriciens, vol. 8, no. 3, pp. 431-447, 1962.
2. J. A. Momoh, Electric Power System Applications of Optimization. New York, NY, USA: Marcel Dekker, 2001.
3. J. Zhu, Optimization of Power System Operation. New York, NY, USA: Wiley, 2009.
4. Z. Qiu, G. Deconinck, and R. Belmans, "A literature survey of optimal power flow problems in the electricity market context," in Proc. Power Systems Conf. Expo., 2009.
5. R. D. Zimmerman, C. E. Murillo-S'anchez, and R. J. Thomas, "MATPOWER steady-state operations, planning and analysis tools for power systems research and education," IEEE Trans. Power Syst., vol. 26, no. 1, pp. 12-19, Feb. 2011.
6. X. Bai, H. Wei, K. Fujisawa, and Y. Wang, "Semidefinite programming for optimal power flow problems," Int. J. Elect. Power Energy Syst., vol. 30, no. 6, pp. 383-392, 2008.
7. J. Lavaei and S. H. Low, "Convexification of optimal power flow problem," in Proc. 48th Annu. Allerton Conf. Communication, Control, and Computing, 2010, pp. 223-232.
8. J. Lavaei and S. H. Low, "Zero duality gap in optimal power flow problem," IEEE Trans. Power Syst., vol. 27, no. 1, pp. 92-107, Feb. 2012.
9. S. Bose, D. F. Gayme, S. Low, and K. M. Chandy, "Optimal power flow over tree networks," in Proc. 48th Annu. Allerton Conf. Communication, Control, and Computing, 2011, pp. 1342-1348.
10. B. Zhang and D. Tse, "Geometry of injection regions of power networks," IEEE Trans. Power Syst., vol. 28, no. 2, pp. 788-797, May 2013.
11. J. F. Sturm, "Using SEDUMI 1.02, a Matlab toolbox for optimization over symmetric cones," Optimiz. Meth. Softw., vol. 11-12, pp. 625-653, 1999.
12. S. J. Benson and Y. Ye, DSDP5: A Software Package Implementing the Dual-Scaling Algorithmfor Semidefinite Programming, Tech. Rep. ANL/MCS-TM-255, 2004, Mathematics and Computer Science Division, Argonne National Laboratory.
13. M. S. Andersen, J. Dahl, and L. Vandenberghe, "Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones," Math. Prog. Computat., vol. 2, pp. 167-201, 2010.
14. R. A. Jabr, "Exploiting sparsity in SDP relaxations of the OPF problem," IEEE Trans. Power Syst., vol. 27, no. 2, pp. 1138-1139, May 2012.
15. M. Fukuda, M. Kojima, K. Murota, and K. Nakata, "Exploiting sparsity in semidefinite programming via matrix completion I: General framework," SIAM J. Optimiz., vol. 11, pp. 647-674, 2000.
16. D. K. Molzahn, J. T. Holzer, B. C. Lesieutre, and C. L. DeMarco, "Implementation of a large-scale optimal power flow solver based on semidefinite programming," IEEE Trans. Power Syst., to be published.
17. R. D. Zimmerman and C. E. Murillo-Sánchez, Dec. 2011, MATPOWER 4.1 User's Manual.
18. A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications. SIAM, 2001.
19. S. Kim and M. Kojima, "Second order cone programming relaxation of nonconvex quadratic optimization problems," Optimiz. Meth. Softw., vol. 15, no. 3-4, pp. 201-224, 2001. (Pubitemid 33817509)
20. J. R. S. Blair and B. Peyton, "An introduction to chordal graphs and clique trees," in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, Eds. New York, NY, USA: Springer-Verlag, 1993.
21. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 2nd ed. New York, NY, USA: Elsevier, 2004.
22. M. S. Andersen, "Chordal sparsity in interior-point methods for conic optimization," Ph.D. dissertation, Univ. California, Los Angeles, CA, USA, 2011.
23. A. Pothen and C. Sun, "Compact clique tree data structures in sparse matrix factorizations," in Large-Scale Numerical Optimization, T. F. Coleman and Y. Li, Eds. Philadelphia, PA, USA: SIAM, 1990, pp. 180-204.
24. M. S. Andersen, J. Dahl, and L. Vandenberghe, "Logarithmic barriers for sparse matrix cones," Optimiz. Meth. Softw., vol. 28, no. 3, pp. 396-423, 2013.
25. R. Grone, C. R. Johnson, E. M. Sá, and H. Wolkowicz, "Positive definite completions of partial Hermitian matrices," Linear Alg. Appl., vol. 58, pp. 109-124, 1984.
26. S. Kim, M. Kojima, M. Mevissen, and M. Yamashita, "Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion," Math. Prog., vol. 129, pp. 33-68, 2011.
27. K. Kobayashi, S. Kim, and M. Kojima, "Correlative sparsity in primaldual interior-point methods for LP, SDP, and SOCP," Appl. Math. Optimiz., vol. 58, no. 1, pp. 69-88, 2008.
28. Y. Sun, M. S. Andersen, and L. Vandenberghe, "Decomposition in conic optimization with partially separable structure," arXiv:1306.0057, 2013.
29. C. Ashcraft and R. Grimes, "The influence of relaxed supernode partitions on the multifrontal method," ACM Trans. Math. Softw., vol. 15, no. 4, pp. 291-309, 1989. (Pubitemid 20636831)
30. J. Hogg and J. Scott, A Modern Analyse Phase for Sparse Tree-Based Direct Methods, Tech. Rep., 2010, Rutherford Appleton Laboratory.
31. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, "Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity," SIAM J. Optimiz., vol. 17, no. 1, pp. 218-241, 2006.