Low, Steven H. (2014) Convex Relaxation of Optimal Power Flow - Part II: Exactness. IEEE Transactions on Control of Network Systems, 1 (2). pp. 177-189. ISSN 2325-5870. doi:10.1109/TCNS.2014.2323634. https://resolver.caltech.edu/CaltechAUTHORS:20150922-153930585
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png) |
PDF (Open Access article)
- Published Version
See Usage Policy. 650kB |
|
PDF
- Submitted Version
See Usage Policy. 1MB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150922-153930585
Abstract
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact.
| Item Type: | Article | ||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||||||||||
| ORCID: |
| ||||||||||||||
| Additional Information: | © 2014 IEEE. Open Access. Manuscript received September 23, 2013; revised April 8, 2014. Date of publication May 14, 2014; date of current version June 16, 2014. This work was supported in part by NSF through NetSE CNS 0911041, in part by ARPA-E through GENI DE-AR0000226, Southern California Edison, in part by the National Science Council of Taiwan through NSC 103-3113-P-008-001, in part by the Los Alamos National Lab (DoE), and in part by Caltech's Resnick Institute. A preliminary and abridged version has appeared in Proc. IREP Symp. Bulk Power Syst. Dynam. Control-IX (IREP), Rethymnon, Greece, August 25–30, 2013. | ||||||||||||||
| Group: | Resnick Sustainability Institute | ||||||||||||||
| Funders: |
| ||||||||||||||
| Subject Keywords: | Convex relaxation, optimal power flow, power systems, quadratically constrained quadratic program (QCQP), second-order cone program (SOCP), semidefinite program (SDP), semidefinite relaxation | ||||||||||||||
| Issue or Number: | 2 | ||||||||||||||
| DOI: | 10.1109/TCNS.2014.2323634 | ||||||||||||||
| Record Number: | CaltechAUTHORS:20150922-153930585 | ||||||||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20150922-153930585 | ||||||||||||||
| Official Citation: | Low, S.H., "Convex Relaxation of Optimal Power Flow—Part II: Exactness," in Control of Network Systems, IEEE Transactions on , vol.1, no.2, pp.177-189, June 2014 doi: 10.1109/TCNS.2014.2323634 | ||||||||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||||||||||
| ID Code: | 60423 | ||||||||||||||
| Collection: | CaltechAUTHORS | ||||||||||||||
| Deposited By: | George Porter | ||||||||||||||
| Deposited On: | 22 Sep 2015 23:02 | ||||||||||||||
| Last Modified: | 10 Nov 2021 22:33 |
Repository Staff Only: item control page
