Optimal Power Flow as a Polynomial Optimization Problem

@article{Ghaddar2016OptimalPF,
  title={Optimal Power Flow as a Polynomial Optimization Problem},
  author={Bissan Ghaddar and Jakub Marecek and M. Mevissen},
  journal={IEEE Transactions on Power Systems},
  year={2016},
  volume={31},
  pages={539-546}
}
  • Bissan Ghaddar, Jakub Marecek, M. Mevissen
  • Published 2016
  • Mathematics, Computer Science
  • IEEE Transactions on Power Systems
  • Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic convergence in theory. We formulate the ACOPF as a degree-two polynomial program and study two approaches to solving it via convexifications. In the first approach, we tighten the first-order relaxation of the nonconvex quadratic program by adding valid inequalities. In the second approach, we exploit the structure… CONTINUE READING
    98 Citations
    Moment-based relaxation of the optimal power flow problem
    • 86
    • PDF
    Alternative LP and SOCP Hierarchies for ACOPF Problems
    • 25
    Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach
    • 45
    • PDF
    Hybrid Methods in Solving Alternating-Current Optimal Power Flows
    • 12
    • Highly Influenced
    • PDF
    Moment relaxations of optimal power flow problems: Beyond the convex hull
    • D. Molzahn, C. Josz, I. Hiskens
    • Mathematics, Computer Science
    • 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
    • 2016
    • 3
    • PDF
    A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
    • 13
    • PDF
    Approximating the ACOPF problem with a hierarchy of SOCP problems
    • 9
    Computing the Feasible Spaces of Optimal Power Flow Problems
    • D. Molzahn
    • Mathematics
    • IEEE Transactions on Power Systems
    • 2017
    • 31
    • PDF

    References

    SHOWING 1-10 OF 34 REFERENCES
    Moment-based relaxation of the optimal power flow problem
    • 86
    • Highly Influential
    • PDF
    Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite Programming
    • 218
    • PDF
    Zero Duality Gap in Optimal Power Flow Problem
    • 964
    • Highly Influential
    • PDF
    Semidefinite programming for optimal power flow problems
    • 435
    Examining the limits of the application of semidefinite programming to power flow problems
    • 231
    • PDF
    Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
    • S. Low
    • Mathematics, Computer Science
    • IEEE Transactions on Control of Network Systems
    • 2014
    • 555
    • PDF
    Local Solutions of the Optimal Power Flow Problem
    • 157
    • PDF
    Application of the Moment-SOS Approach to Global Optimization of the OPF Problem
    • 97
    • PDF
    Local Solutions of Optimal Power Flow
    • 35
    • Highly Influential
    Geometry of Power Flows and Optimization in Distribution Networks
    • 150
    • PDF