The DOI matches its Crossref record.
Examining the limits of the application of semidefinite programming to power flow problems
Abstract
The application of semidefinite programming (SDP) to power system problems has recently attracted substantial research interest. Specifically, a recent SDP formulation offers a convex relaxation to the well-known, typically nonconvex "optimal power flow" (OPF) problem. This new formulation was demonstrated to yield zero duality gap for several standard power systems test cases, thereby ensuring a globally optimal OPF solution in each. The first goal of the work here is to investigate this SDP algorithm for the OPF, and show by example that it can fail to give a physically meaningful solution (i.e., it has a non-zero duality gap) in some scenarios of practical interest. The remainder of this paper investigates an SDP approach utilizing modified objective and constraints to compute all solutions of the nonlinear power flow equations. Several variants are described. Results suggest SDP's promise as an efficient algorithm for identifying large numbers of solutions to the power flow equations.
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
Cited by
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
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-citationConvex 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
Exact 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
A Fully Distributed Reactive Power Optimization and Control Method for Active Distribution Networks
Zheng, W., Wu, W., Zhang, B., Sun, H., & Liu, Y. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2396493 · Cited by 371
Metadata
- Authors
- Lesieutre, B. C., Molzahn, D. K., Borden, A. R., & DeMarco, C. L.
- Venue
- 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- Publisher
- IEEE
- Published
- 2011-09
- Pages
- 1492-1499
- OpenAlex
- W2104106131
- Cited by
- 219
- References
- 0
- FWCI
- 27.40
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Examining the limits of the application of semidefinite programming to power flow problems. https://app.cochat.ai/papers/10.1109/allerton.2011.6120344
- The paper
- Lesieutre, B. C., Molzahn, D. K., Borden, A. R., & DeMarco, C. L. (2011). Examining the limits of the application of semidefinite programming to power flow problems. 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). https://doi.org/10.1109/allerton.2011.6120344
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.