Application of the Moment-SOS Approach to Global Optimization of the OPF Problem

Abstract : Finding a global solution to the optimal power flow (OPF) problem is difficult due to its nonconvexity. A convex relaxation in the form of semidefinite programming (SDP) has attracted much attention lately as it yields a global solution in several practical cases. However, it does not in all cases, and such cases have been documented in recent publications. This paper presents another SDP method known as the moment-sos (sum of squares) approach, which generates a sequence that converges towards a global solution to the OPF problem at the cost of higher runtime. Our finding is that in the small examples where the previously studied SDP method fails, this approach finds the global solution. The higher cost in runtime is due to an increase in the matrix size of the SDP problem, which can vary from one instance to another. Numerical experiment shows that the size is very often a quadratic function of the number of buses in the network, whereas it is a linear function of the number of buses in the case of the previously studied SDP method.
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.inria.fr/hal-00906483
Contributor : Jean Charles Gilbert <>
Submitted on : Tuesday, November 26, 2013 - 12:44:39 PM
Last modification on : Friday, April 19, 2019 - 3:24:18 PM
Long-term archiving on : Thursday, February 27, 2014 - 9:40:31 AM

File

RR-8397.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Cédric Josz, Jean Maeght, Patrick Panciatici, Jean Charles Gilbert. Application of the Moment-SOS Approach to Global Optimization of the OPF Problem. IEEE Transactions on Power Systems, Institute of Electrical and Electronics Engineers, 2014, 30 (1), pp.8. ⟨10.1109/TPWRS.2014.2320819⟩. ⟨hal-00906483v2⟩

Share

Metrics

Record views

475

Files downloads

557