Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 162

The DOI matches its Crossref record.

Sparsity-Exploiting Moment-Based Relaxations of the Optimal Power Flow Problem

Open access
Molzahn, Daniel K., Hiskens, Ian A.·2015·IEEE Transactions on Power Systems

Abstract

Convex relaxations of non-convex optimal power flow (OPF) problems have recently attracted significant interest. While existing relaxations globally solve many OPF problems, there are practical problems for which existing relaxations fail to yield physically meaningful solutions. This paper applies moment relaxations to solve many of these OPF problems. The moment relaxations are developed from the Lasserre hierarchy for solving generalized moment problems. Increasing the relaxation order in this hierarchy results in “tighter” relaxations at the computational cost of larger semidefinite programs. Low-order moment relaxations are capable of globally solving many small OPF problems for which existing relaxations fail. By exploiting sparsity and only applying the higher-order relaxation to specific buses, global solutions to larger problems are computationally tractable through the use of an iterative algorithm informed by a heuristic for choosing where to apply the higher-order constraints. With standard semidefinite programming solvers, the algorithm globally solves many test systems with up to 300 buses for which the existing semidefinite relaxation fails to yield globally optimal solutions.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpwrs.2014.2372478

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 162

Metadata

Authors
Molzahn, D. K., & Hiskens, I. A.
Venue
IEEE Transactions on Power Systems
Published
2015-11
Volume
30
Issue
6
Pages
3168-3180
ISSN
  • 0885-8950 (ISSN-L)
  • 1558-0679
OpenAlex
W1997135619
Cited by
162
References
0
FWCI
11.67
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: Sparsity-Exploiting Moment-Based Relaxations of the Optimal Power Flow Problem. https://app.cochat.ai/papers/10.1109/tpwrs.2014.2372478
The paper
Molzahn, D. K., & Hiskens, I. A. (2015). Sparsity-Exploiting Moment-Based Relaxations of the Optimal Power Flow Problem. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2014.2372478

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.