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} }
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
Paper Mentions
98 Citations
Moment-based relaxation of the optimal power flow problem
- Computer Science, Mathematics
- 2014 Power Systems Computation Conference
- 2014
- 86
- PDF
Alternative LP and SOCP Hierarchies for ACOPF Problems
- Mathematics
- IEEE Transactions on Power Systems
- 2017
- 25
Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach
- Mathematics, Computer Science
- IEEE Transactions on Smart Grid
- 2017
- 45
- PDF
Mathematical programming formulations for the alternating current optimal power flow problem
- Computer Science, Mathematics
- 4OR
- 2020
- PDF
Hybrid Methods in Solving Alternating-Current Optimal Power Flows
- Computer Science, Mathematics
- IEEE Transactions on Smart Grid
- 2017
- 12
- Highly Influenced
- PDF
Moment relaxations of optimal power flow problems: Beyond the convex hull
- Mathematics, Computer Science
- 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
- 2016
- 3
- PDF
A multitree approach for global solution of ACOPF problems using piecewise outer approximations
- Mathematics, Computer Science
- Comput. Chem. Eng.
- 2018
- 9
A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- Mathematics, Computer Science
- Optim. Methods Softw.
- 2017
- 13
- PDF
Approximating the ACOPF problem with a hierarchy of SOCP problems
- Mathematics
- 2015 IEEE Power & Energy Society General Meeting
- 2015
- 9
Computing the Feasible Spaces of Optimal Power Flow Problems
- 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
- Computer Science, Mathematics
- 2014 Power Systems Computation Conference
- 2014
- 86
- Highly Influential
- PDF
Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite Programming
- Mathematics
- IEEE Transactions on Power Systems
- 2013
- 218
- PDF
Zero Duality Gap in Optimal Power Flow Problem
- Mathematics
- IEEE Transactions on Power Systems
- 2012
- 964
- Highly Influential
- PDF
Examining the limits of the application of semidefinite programming to power flow problems
- Mathematics, Computer Science
- 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2011
- 231
- PDF
Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Mathematics, Computer Science
- IEEE Transactions on Control of Network Systems
- 2014
- 555
- PDF
Local Solutions of the Optimal Power Flow Problem
- Engineering, Mathematics
- IEEE Transactions on Power Systems
- 2013
- 157
- PDF
Application of the Moment-SOS Approach to Global Optimization of the OPF Problem
- Mathematics
- IEEE Transactions on Power Systems
- 2015
- 97
- PDF
Geometry of Power Flows and Optimization in Distribution Networks
- Mathematics, Computer Science
- IEEE Transactions on Power Systems
- 2014
- 150
- PDF