Global optimization for optimal power flow over transmission networks
J. Global Optimization(2017)
摘要
The optimal power flow (OPF) problem for power transmission networks is an NP-hard optimization problem with nonlinear constraints on complex bus voltages. The existing nonlinear solvers may fail in yielding a feasible point. Semi-definite relaxation (SDR) could provide the global solution only when the matrix solution of the relaxed semi-definite program (SDP) is of rank-one, which does not hold in general. Otherwise, the point found by SDR is infeasible. High-order SDR has recently been used to find the global solution, which leads to explosive growth of the matrix variable dimension and semi-definite constraints. Consequently, it is suitable only for OPF over very small networks with a few buses. In this paper, we follow our previously developed nonsmooth optimization approach to address this difficult OPF problem, which is an iterative process to generate a sequence of improved points that converge to a global solution in many cases. Each iteration calls an SDP of moderate dimension. Simulations are provided to demonstrate the efficiency of our approach.
更多查看译文
关键词
Optimal power flow (OPF),Transmission networks,Rank-one matrix constraint,Nonsmooth optimization,Semi-definite programming (SDP),Global optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要