The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Convex Relaxation of Optimal Power Flow—Part II: Exactness
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Branch Flow Model: Relaxations and Convexification—Part I
Farivar, M., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2255317 · Cited by 1,541
Self-citationInverter 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
Self-citationGeometry of injection regions of power networks
Zhang, B., & Tse, D. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2208205 · Cited by 118
Optimal power flow in distribution networks
(2018) · Metaheuristic Optimization in Power Engineering · doi:10.1049/pbpo131e_ch9 · Cited by 15
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
Self-citationExact Convex Relaxation of Optimal Power Flow in Radial Networks
Gan, L., Li, N., Topcu, U., & Low, S. H. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2332712 · Cited by 500
Self-citationDistributed Optimal Energy Management in Microgrids
Shi, W., Xie, X., Chu, C.-C., & Gadh, R. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2014.2373150 · Cited by 492
Convex relaxations and linear approximation for optimal power flow in multiphase radial networks
Gan, L., & Low, S. H. (2014) · 2014 Power Systems Computation Conference · doi:10.1109/pscc.2014.7038399 · Cited by 416
Self-citationEnhancing Distribution System Resilience With Mobile Energy Storage and Microgrids
Kim, J., & Dvorkin, Y. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2018.2872521 · Cited by 410
Metadata
- Authors
- Low, S. H.
- Venue
- IEEE Transactions on Control of Network Systems
- Published
- 2014-06
- Volume
- 1
- Issue
- 2
- Pages
- 177-189
- ISSN
- 2325-5870 (ISSN-L)
- OpenAlex
- W2170736358
- Cited by
- 523
- References
- 5
- FWCI
- 19.46
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convex Relaxation of Optimal Power Flow—Part II: Exactness. https://app.cochat.ai/papers/10.1109/tcns.2014.2323634
- The paper
- Low, S. H. (2014). Convex Relaxation of Optimal Power Flow—Part II: Exactness. IEEE Transactions on Control of Network Systems. https://doi.org/10.1109/tcns.2014.2323634
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.