Physics of power networks makes hard optimization problems easy to solve

By Somayeh Sojoudi, Javad Lavaei. IEEE Power & Energy Society General Meeting, 2012

174 citations recorded by the source corpus.

Subfields: Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/960ca5ac1cc26d7d4abb32ec38d191f3b6ad387b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Electrical and Electronic Engineering

Citations in the corpus

Exact Convex Relaxation of Optimal Power Flow in Radial Networks (2013, background): “not necessary in general and have implications on allowable power injections, voltage magnitudes, or voltage angles: A Power injections: These conditions require that not both constraints on real and reactive power injections be binding at both ends of a line [30], [31], [42]–[44].”
Optimization of AC Transmission System Planning (2013, methodology): “The relaxation of the proposed AC TNEP model is a convex program, particularly a quadratic cone program; however, unlike the model in [25], it includes additional linear constraints that mitigate the effect of the virtual controllable phase shifters and lead to solutions that satisfy the exact AC ne”
Conic relaxations of the unit commitment problem (2017, background): “[31] discover that the success of this method is related to the underlying physics of power systems.”
Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow (2014, background): “— In [8], it is proven that SDP relaxation is exact if load oversatisfaction is allowed and a sufficient number of virtual phase shifters are present.”
Polyhedral Formulations and Loop Elimination Constraints for Distribution Network Expansion Planning (2013, methodology): “The semi-definite constraint in the modified problem can be further replaced with a set of rotated conic quadratic constraints [18]:”
Application of the Moment-SOS Approach to Global Optimization of the OPF Problem (2013, background): “Authors of [17], [18], and [19] prove that the rank constraint is”
Strong SOCP Relaxations for the Optimal Power Flow Problem (2015, background): “…a restricted class of problems under some assumptions, e.g. radial networks (Zhang and Tse 2011, Bose et al. 2011, 2012) under load over-satisfaction (Sojoudi and Lavaei 2012) or absence of generation lower bounds (Lavaei et al. 2014), or lossless networks with cyclic graphs (Zhang and Tse 2013).”
Convex relaxation of optimal power flow: A tutorial (2013, methodology): “The use of phase shifters to convexify AC mesh networks has also been observed in [47] for the bus injection model.”
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems (2017, background): “SOCP relaxations are also proposed in [27] and [28] for the model (1).”