Optimal Power Flow as a Polynomial Optimization Problem

IEEE Transactions on Power Systems

Volumn 31, Issue 1, 2016, Pages 539-546

  Ghaddar, Bissan ^a   Marecek, Jakub ^a   Mevissen, Martin ^a  

^a IBM RESEARCH   (Ireland)

Author keywords

Mathematical programming; method of moments; numerical analysis; optimization; power system management; sparse matrices

Indexed keywords

ACOUSTIC GENERATORS; OPTIMIZATION; POLYNOMIALS; QUADRATIC PROGRAMMING;

ALTERNATING CURRENT; ASYMPTOTIC CONVERGENCE; GLOBAL OPTIMALITY; NONCONVEX QUADRATIC PROGRAMS; OPTIMAL POWER FLOWS; POLYNOMIAL OPTIMIZATION PROBLEM; POLYNOMIAL PROGRAMS; VALID INEQUALITY;

ELECTRIC LOAD FLOW;

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

References (24)

1. X. Bai, H. Wei, K. Fujisawa, and Y. Wang, "Semidefinite programming for optimal power flow problems, " Int. J. Electr. Power & Energy Syst., vol. 30, no. 6, pp. 383-392, 2008.
2. W. A. Bukhsh, A. Grothey, K. I. McKinnon, and P. Trodden, "Local solutions of optimal power flow, " IEEE Trans. Power Syst., vol. 28, no. 4, pp. 4780-4788, Nov. 2013.
3. F. Capitanescu, J. L. M. Ramos, P. Panciatici, D. Kirschen, A. M. Mar-colini, L. Platbrood, and L. Wehenkel, "State-of-the-art, challenges, and future trends in security constrained optimal power flow, " Electric Power Syst. Res., vol. 81, no. 8, pp. 1731-1741, 2011.
4. B. Ghaddar, "New conic optimization techniques for solving binary polynomial programming problems, " Ph.D. dissertation, Dept. Manag. Sci., Univ. Waterloo, Waterloo, ON, Canada, 2011.
5. B. Ghaddar, J. Vera, and M. Anjos, "An iterative scheme for valid polynomial inequality generation in binary polynomial programming, " Integer Programming and Combinatoral Optimization, ser. LNCS, vol. 6655, pp. 207-222, 2011.
6. 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.
7. C. Josz, J. Maeght, P. Panciatici, and J. C. Gilbert, "Application of the moment-SOS approach to global optimization of the OPF problem, " arXiv:1311.6370v1, 2013.
8. S. Kim, M. Kojima, M. Mevissen, and M. Yamashita, "Exploiting spar-sity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, " Math. Programming, vol. 129, no. 1, pp. 33-68.
9. M. Kojima and M. Muramatsu, "A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones, " Computational Optim. Applications, vol. 42, no. 1, pp. 31-41, 2009.
10. J. Lasserre, "Global optimization problems with polynomials and the problem of moments, " SIAM J. Optim., vol. 11, pp. 796-817, 2001.
11. J. Lasserre, "Convergent SDP-relaxations in polynomial optimization with sparsity, " SIAM J. Optim., vol. 17, no. 3, pp. 882-843, 2006.
12. J. Lavaei and S. Low, "Zero duality gap in optimal power flow problem, " IEEE Trans. Power Syst., vol. 27, no. 1, pp. 92-107, Feb. 2012.
13. J. Lavaei, D. Tse, and B. Zhang, "Geometry of power flows and optimization in distribution networks, " IEEE Trans. Power Syst., vol. 29, no. 2, pp. 572-583, May 2014.
14. B. Lesieutre, D. Molzahn, A. Borden, and C. DeMarco, "Examining the limits of the application of semidefinite programming to power flow problems, " in Proc. 49th Annu. Allerton Conf., 2011, pp. 1492-1499.
15. S. H. Low, "Convex relaxation of optimal power flow part I: Formulations and equivalence, " IEEE Trans. Control Network Syst., vol. 1, no. 1, pp. 15-27, Jan. 2014.
16. D. Molzahn, J. Holzer, B. Lesieutre, and C. DeMarco, "Implementation of a large-scale optimal power flow solver based on semidefinite programming, " IEEE Trans. Power Syst., vol. 28, no. 4, pp. 3987-3998, Nov. 2013.
17. D. K. Molzahn and I. A. Hiskens, "Moment-based relaxation of the optimal power flow problem, " arXiv:1312.1992v2, 2013.
18. U. Washington, "Power systems test case archive, ".
19. K. Pandya and S. Joshi, "A survey of optimal power flow methods, " J. Theoretical Appl. Inf. Technol., vol. 4, no. 5, pp. 450-458, 2008.
20. S. Sojoudi and J. Lavaei, "Semidefinite relaxation for nonlinear optimization over graphs with application to power systems, " Univ. Columbia, 2013, Preprint.
21. J. Sturm, "Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, " Optim. Methods Software, pp. 11-12, 1999.
22. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, "Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity, " SIAM J. Optim., vol. 17, no. 1, pp. 218-242, 2006.
23. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, "SparsePOP: A sparse semidefinite programming relaxation of polynomial optimization problems, " ACM Trans. Math. Software, vol. 35, no. 2, p. 15, 2008.
24. B. Zhang and D. Tse, "Geometry of injection regions of power networks, " IEEE Trans. Power Syst., vol. 28, no. 2, pp. 788-797, 2013.