Strong SOCP Relaxations for the Optimal Power Flow Problem

References

• Bai X, Wei H (2009) Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraints. IET Generation Transmission Distribution 3(2):182–197.Crossref, Google Scholar
• Bai X, Wei H, Fujisawa K, Wang Y (2008) Semidefinite programming for optimal power flow problems. Internat. J. of Electric Power Energy Systems 30(6–7):383–392.Crossref, Google Scholar
• Baran ME, Wu FF (1989a) Optimal capacitor placement on radial distribution systems. IEEE Trans. Power Delivery 4(1):725–734.Crossref, Google Scholar
• Baran ME, Wu FF (1989b) Optimal sizing of capacitors placed on a radial distribution system. IEEE Trans. Power Delivery 4(1):735–743.Crossref, Google Scholar
• Bienstock D, Munoz G (2014) On linear relaxations of OPF problems. arXiv preprint arXiv:1411.1120.Google Scholar
• Bose S, Gayme DF, Chandy KM, Low SH (2012) Quadratically constrained quadratic programs on acyclic graphs with application to power flow. arXiv preprint arXiv:1203.5599.Google Scholar
• Bose S, Gayme DF, Low S, Chandy KM (2011) Optimal power flow over tree networks. 49th Ann. Allerton Conf. Comm., Control, Comput (Allerton), 1342–1348.Crossref, Google Scholar
• Cain MB, O’Neill RP, Castillo A (2012) History of optimal power flow and formulations. http://www.ferc.gov/industries/electric/indus-act/market-planning/opf-papers/acopf-1-history-formulation-testing.pdf.Google Scholar
• Carpentier J (1962) Contributions to the economic dispatch problem. Bull Soc. Francaise Electriciens 8(3):431–447.Google Scholar
• Coffrin C, Van Hentenryck P (2014) A linear-programming approximation of AC power flows. INFORMS J. Comput. 26(4):718–734.Link, Google Scholar
• Coffrin C, Gordon D, Scott P (2014) NESTA, The NICTA energy system test case archive. arXiv preprint arXiv:1411.0359.Google Scholar
• Coffrin C, Hijazi HL, Van Hentenryck P (2015) The QC relaxation: Theoretical and computational results on optimal power flow. arXiv preprint arXiv:1502.07847.Google Scholar
• Expósito AG, Ramos ER (1999) Reliable load flow technique for radial distribution networks. IEEE Trans. Power Syst. 14(3):1063–1069.Crossref, Google Scholar
• FERC (2011) Recent ISO Software Enhancements and Future Software and Modeling Plans. http://www.ferc.gov/industries/electric/indus-act/rto/rto-iso-soft-2011.pdf.Google Scholar
• Frank S, Steponavice I, Rebennack S (2012a) Optimal power flow: A bibliographic survey i—Formulations and deterministic methods. Energy Systems 3(3):221–258.Crossref, Google Scholar
• Frank S, Steponavice I, Rebennack S (2012b) Optimal power flow: A bibliographic survey ii—Nondeterministic and hybrid methods. Energy Systems 3(3):259–289.Crossref, Google Scholar
• Fukuda M, Kojima M, Murota K, Nakata K (2001) Exploiting sparsity in semidefinite programming via matrix completion I: General framework. SIAM J. Optim. 11(3):647–674.Crossref, Google Scholar
• Hijazi HL, Coffrin C, Van Hentenryck P (2013) Convex quadratic relaxations of mixed-integer nonlinear programs in power syst. Technical report, NICTA, Canberra, ACT Australia.Google Scholar
• Horn RA, Johnson CR (2013) Matrix Analysis, 2nd ed. (Cambridge University Press, Cambridge, UK).Google Scholar
• Jabr RA (2006) Radial distribution load flow using conic programming. IEEE Trans. Power Syst. 21(3):1458–1459.Crossref, Google Scholar
• Jabr RA (2007) A conic quadratic format for the load flow equations of meshed networks. IEEE Trans. Power Syst. 22(4):2285–2286.Crossref, Google Scholar
• Jabr RA (2008) Optimal power flow using an extended conic quadratic formulation. IEEE Trans. Power Syst. 23(3):1000–1008.Crossref, Google Scholar
• Jabr RA (2012) Exploiting sparsity in SDP relaxations of the OPF problem. IEEE Trans. Power Syst. 27(2):1138–1139.Crossref, Google Scholar
• Jabr RA, Coonick AH, Cory BJ (2002) A primal-dual interior point method for optimal power flow dispatching. IEEE Trans. Power Syst. 17(3):654–662.Crossref, Google Scholar
• Josz C, Maeght J, Panciatici P, Gilbert JC (2015) Application of the moment-sos approach to global optimization of the opf problem. IEEE Trans. Power Syst. 30(1):463–470.Crossref, Google Scholar
• Kavitha T, Liebchen C, Mehlhorn K, Michail D, Rizz R, Rizz R, Uekerbt T, Zweig KA (2003) Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Science Rev. 3(4):199–243.Crossref, Google Scholar
• Kocuk B, Dey SS, Sun XA (2015) Inexactness of SDP relaxation and valid inequalities for optimal power flow. IEEE Trans. Power Syst. To appear.Google Scholar
• Kocuk B, Jeon H, Dey SS, Linderoth J, Luedtke J, Sun XA (2014) A cycle-based formulation and valid inequalities for DC power transmission problems with switching. arXiv preprint arXiv:1412.6245.Google Scholar
• Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3):796–817.Crossref, Google Scholar
• Lavaei J, Low SH (2012) Zero duality gap in optimal power flow problem. IEEE Trans. Power Syst. 27(1):92–107.Crossref, Google Scholar
• Lavaei J, Tse D, Zhang B (2014) Geometry of power flows and optimization in distribution networks. IEEE Trans. Power Syst. 29(2):572–583.Crossref, Google Scholar
• Low SH (2014a) Convex relaxation of optimal power flow, part I: Formulations and equivalence. IEEE Trans. Control Netw. Syst. 1(1):15–27.Crossref, Google Scholar
• Low SH (2014b) Convex relaxation of optimal power flow, part II: Exactness. IEEE Trans. Control Netw. Syst. 1(2):177–189.Crossref, Google Scholar
• Madani R, Ashraphijuo M, Lavaei J (2014a) OPF solver guide. http://ieor.berkeley.edu/~lavaei/Software.html.Google Scholar
• Madani R, Ashraphijuo M, Lavaei J (2014b) Promises of conic relaxation for contingency-constrained optimal power flow problem. 52nd Ann. Allerton Conf. Commun., Control, and Comput., Monticello, IL, 1064–1071.Crossref, Google Scholar
• Madani R, Sojoudi S, Lavaei J (2013) Convex relaxation for optimal power flow problem: Mesh networks. Asilomar Conf. Signals, Systems and Computers, ACSSC, (IEEE, Piscataway, NJ), 1375–1382.Crossref, Google Scholar
• Madani R, Sojoudi S, Lavaei J (2015) Convex relaxation for optimal power flow problem: Mesh networks. IEEE Trans. Power Syst. 30(1):199–211.Crossref, Google Scholar
• McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: Part I—Convex underestimating problems. Math. Programming 10(1):147–175.Crossref, Google Scholar
• Molzahn DK, Hiskens IA (2015) Sparsity-exploiting moment-based relaxations of the optimal power flow problem. IEEE Trans. Power Syst. To appear.Crossref, Google Scholar
• Molzahn DK, Holzer JT, Lesieutre BC, DeMarco CL (2013) Implementation of a large-scale optimal power flow solver based on semidefinite programming. IEEE Trans. Power Syst. 28(4):3987–3998.Crossref, Google Scholar
• Momoh JA, El-Hawary ME, Adapa R (1999a) A review of selected optimal power flow literature to 1993 part i: Nonlinear and quadratic programming approaches. IEEE Trans. Power Syst. 14(1):96–104.Crossref, Google Scholar
• Momoh JA, El-Hawary ME, Adapa R (1999b) A review of selected optimal power flow literature to 1993 part ii: Newton, linear programming and interior point methods. IEEE Trans. Power Syst. 14(1):105–111.Crossref, Google Scholar
• MOSEK (2013) MOSEK Modeling Manual (MOSEK ApS).Google Scholar
• Nakata K, Fujisawa K, Fukuda M, Kojima M, Murota K (2003) Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results. Math. Programming 95(2):303–327.Crossref, Google Scholar
• Parrilo P (2003) Semidefinite programming relaxations for semialgebraic problems. Math. Programming 96(2):293–320.Crossref, Google Scholar
• Sojoudi S, Lavaei J (2012) Physics of power networks makes hard optimization problems easy to solve. IEEE Power and Energy Soc. General Meeting (IEEE, Piscataway, NJ), 1–8.Crossref, Google Scholar
• Sojoudi S, Lavaei J (2013) On the exactness of semidefinite relaxation for nonlinear optimization over graphs: Part II. IEEE 52nd Ann. Conf. Decision and Control (CDC) (IEEE, Piscataway, NJ), 1051–1057.Crossref, Google Scholar
• Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math. Programming 103(2):225–249.Crossref, Google Scholar
• Taylor JA (2015) Convex Optimization of Power Systems (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Torres GL, Quintana VH (1998) An interior-point method for nonlinear optimal power flow using voltage rectangular coordinates. IEEE Trans. Power Syst. 13(4):1211–1218.Crossref, Google Scholar
• Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1):25–57.Crossref, Google Scholar
• Wang H, Murillo-Sánchez CE, Zimmerman RD, Thomas RJ (2007) On computational issues of market based optimal power flow. IEEE Trans. Power Syst. 22(3):1185–1193.Crossref, Google Scholar
• Wu Y, Debs AS, Marsten RE (1994) A direct nonlinear predictor-corrector primal-dual interior point algorithm for optimal power flows. IEEE Trans. Power Syst. 9(2):876–883.Crossref, Google Scholar
• Zhang B, Tse D (2011) Geometry of feasible injection region of power networks. 49th Ann. Allerton Conf. Comm., Control, and Comput., Monticello, IL, 1508–1515.Crossref, Google Scholar
• Zhang B, Tse D (2013) Geometry of feasible injection region of power networks. IEEE Trans. Power Syst. 28(2):788–797.Crossref, Google Scholar
• Zimmerman RD, Murillo-Sanchez CE, Thomas RJ (2011) MATPOWER: Steady-state operations, planning, and analysis tools for power syst. research and education. IEEE Trans. Power Syst. 26(1):12–19.Crossref, Google Scholar