Power flow optimization using positive quadratic programming
The problem to minimize power losses in an electrical network subject to voltage and power constraints is in general hard to solve. However, it has recently been discovered that semidefinite programming relaxations in many cases enable exact computation of the global optimum. Here we point out a fundamental reason for the successful relaxations, namely that the passive network components give rise