The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow
Abstract
Convex relaxations of the power flow equations and, in particular, the semi-definite programming (SDP) and second-order cone (SOC) relaxations, have attracted significant interest in recent years. The quadratic convex (QC) relaxation is a departure from these relaxations in the sense that it imposes constraints to preserve stronger links between the voltage variables through convex envelopes of the polar representation. This paper is a systematic study of the QC relaxation for AC optimal power flow with realistic side constraints. The main theoretical result shows that the QC relaxation is stronger than the SOC relaxation and neither dominates nor is dominated by the SDP relaxation. In addition, comprehensive computational results show that the QC relaxation may produce significant improvements in accuracy over the SOC relaxation at a reasonable computational cost, especially for networks with tight bounds on phase angle differences. The QC and SOC relaxations are also shown to be significantly faster and reliable compared to the SDP relaxation given the current state of the respective solvers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Power System Stability and Control
Kundur, P. (1994) · Cited by 19,639
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
Zimmerman, R. D., Murillo-Sanchez, C. E., & Thomas, R. J. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2010.2051168 · Cited by 6,756
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
McCormick, G. P. (1976) · Mathematical Programming · doi:10.1007/bf01580665 · Cited by 2,281
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
Zero Duality Gap in Optimal Power Flow Problem
Lavaei, J., & Low, S. H. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2160974 · Cited by 1,195
Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
Low, S. H. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2309732 · Cited by 929
Momoh, J. A., Adapa, R., & El-Hawary, M. E. (1999) · IEEE Transactions on Power Systems · doi:10.1109/59.744492 · Cited by 836
Radial Distribution Load Flow Using Conic Programming
Jabr, R. A. (2006) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2006.879234 · Cited by 713
SDPT3 -- A Matlab Software Package for Semidefinite Programming
Toh, K.-C., Todd, M. J., & Tütüncü, R. H. (1996) · eCommons (Cornell University) · Cited by 663
Momoh, J. A., El-Hawary, M. E., & Adapa, R. (1999) · IEEE Transactions on Power Systems · doi:10.1109/59.744495 · Cited by 645
State-of-the-art, challenges, and future trends in security constrained optimal power flow
Capitanescu, F., Ramos, J. L. M., Panciatici, P., Kirschen, D. S., Marano‐Marcolini, A., Platbrood, L., & Wehenkel, L. A. (2011) · Electric Power Systems Research · doi:10.1016/j.epsr.2011.04.003 · Cited by 604
Convex Relaxation of Optimal Power Flow -- Part I: Formulations and EquivalencePreprint
Low, S. H. (2014) · Cited by 592
Semidefinite programming for optimal power flow problems
Bai, X., Wei, H., Fujisawa, K., & Wang, Y. (2008) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2007.12.003 · Cited by 573
Convex Relaxation of Optimal Power Flow—Part II: Exactness
Low, S. H. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2323634 · Cited by 523
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
Bienstock, D., Chertkov, M., & Harnett, S. (2014) · SIAM Review · doi:10.1137/130910312 · Cited by 496
Convex Models of Distribution System Reconfiguration
Taylor, J. A., & Hover, F. S. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2184307 · Cited by 444
Usefulness of DC power flow for active power flow analysis
Purchala, K., Meeus, L., Van Dommelen, D., & Belmans, R. (2005) · IEEE Power Engineering Society General Meeting, 2005 · doi:10.1109/pes.2005.1489581 · Cited by 386
Inverter VAR control for distribution systems with renewables
Farivar, M., Clarke, C. R., Low, S. H., & Chandy, K. M. (2011) · 2011 IEEE International Conference on Smart Grid Communications (SmartGridComm) · doi:10.1109/smartgridcomm.2011.6102366 · Cited by 331
Convex Relaxation of Optimal Power Flow Part II: Exactness
Low, S. H. (2014) · Cited by 319
Local Solutions of the Optimal Power Flow Problem
Bukhsh, W. A., Grothey, A., McKinnon, K. I. M., & Trodden, P. A. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2274577 · Cited by 222
AC-feasibility on tree networks is NP-hard
Lehmann, K., Grastien, A., & Van Hentenryck, P. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2407363 · Cited by 221
Examining the limits of the application of semidefinite programming to power flow problems
Lesieutre, B. C., Molzahn, D. K., Borden, A. R., & DeMarco, C. L. (2011) · 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2011.6120344 · Cited by 219
Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
Hijazi, H., Coffrin, C., & Hentenryck, P. V. (2017) · Mathematical Programming Computation · doi:10.1007/s12532-016-0112-z · Cited by 197
Self-citationNESTA, The NICTA Energy System Test Case ArchivePreprint
Coffrin, C., Gordon, D., & Scott, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.0359 · Cited by 185
Self-citationEquivalent Relaxations of Optimal Power Flow
Bose, S., Low, S. H., Teeraratkul, T., & Hassibi, B. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2357112 · Cited by 184
Physics of power networks makes hard optimization problems easy to solve
Sojoudi, S., & Lavaei, J. (2012) · 2012 IEEE Power and Energy Society General Meeting · doi:10.1109/pesgm.2012.6345272 · Cited by 164
Sparsity-Exploiting Moment-Based Relaxations of the Optimal Power Flow Problem
Molzahn, D. K., & Hiskens, I. A. (2015) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2372478 · Cited by 162
Reliable load flow technique for radial distribution networks
Gomez Exposito, A., & Romero Ramos, E. (1999) · IEEE Transactions on Power Systems · doi:10.1109/59.780924 · Cited by 159
A Comprehensive Centralized Approach for Voltage Constraints Management in Active Distribution Grid
Capitanescu, F., Bilibin, I., & Romero-Ramos, E. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2287897 · Cited by 158
Equivalence of branch flow and bus injection models
Subhonmesh, B., Low, S. H., & Chandy, K. M. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483453 · Cited by 103
Conic AC transmission system planning
Taylor, J. A., & Hover, F. S. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2214490 · Cited by 81
Power grid security analysis: an optimization approach
Bienstock, D., & Verma, A. (2010) · Cited by 54
Network flow and copper plate relaxations for AC transmission systems
Coffrin, C., Hijazi, H., & Hentenryck, P. V. (2016) · Power Systems Computation Conference · doi:10.1109/pscc.2016.7540869 · Cited by 50
Self-citationPromises of conic relaxation for contingency-constrained optimal power flow problem
Madani, R., Ashraphijuo, M., & Lavaei, J. (2014) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2014.7028573 · Cited by 31
Optimal AC Distribution Systems Reconfiguration
Hijazi, H., & Thiébaux, S. (2014) · Power Systems Computation Conference · doi:10.1109/pscc.2014.7038420 · Cited by 18
Self-citationNetwork Flow and Copper Plate Relaxations for AC Transmission SystemsPreprint
Coffrin, C., Hijazi, H., & Hentenryck, P. V. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.05202 · Cited by 9
Self-citation
Cited by
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Yang, Z., Zhong, H., Bose, A., Zheng, T., Xia, Q., & Kang, C. (2018) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2017.2718551 · Cited by 330
Power systems optimization under uncertainty: A review of methods and applications
Roald, L. A., Pozo, D., Papavasiliou, A., Molzahn, D. K., Kazempour, J., & Conejo, A. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2022.108725 · Cited by 317
A Survey of Relaxations and Approximations of the Power Flow Equations
Molzahn, D. K., & Hiskens, I. A. (2019) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000012 · Cited by 272
PowerModels. JL: An Open-Source Framework for Exploring Power Flow Formulations
Coffrin, C., Bent, R., Sundar, K., Ng, Y., & Lubin, M. (2018) · 2018 Power Systems Computation Conference (PSCC) · doi:10.23919/pscc.2018.8442948 · Cited by 257
Self-citation
Metadata
- Authors
- Coffrin, C., Hijazi, H. L., & Van Hentenryck, P.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2016-07
- Volume
- 31
- Issue
- 4
- Pages
- 3008-3018
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W2345649991
- Cited by
- 341
- References
- 38
- FWCI
- 11.39
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.