A Low-Rank Coordinate-Descent Algorithm for Semidefinite Programming Relaxations of Optimal Power Flow
arXiv:1506.08568 · doi:10.1080/10556788.2017.1288729
Abstract
The alternating-current optimal power flow (ACOPF) is one of the best known non-convex non-linear optimisation problems. We present a novel re-formulation of ACOPF, which is based on lifting the rectangular power-voltage rank-constrained formulation, and makes it possible to derive alternative SDP relaxations. For those, we develop a first-order method based on the parallel coordinate descent with a novel closed-form step based on roots of cubic polynomials.
References in corpus (6)
- New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem
- On the low-rank approach for semidefinite programs arising in synchronization and community detection
- Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization
- The non-convex Burer-Monteiro approach works on smooth semidefinite programs
- MINLP in Transmission Expansion Planning
- LP approximations to mixed-integer polynomial optimization problems