Paper Info
Title
Multiple Matrix Rank Constrained Optimization for Optimal Power Flow over Large Scale Transmission Networks.
Abstract
The optimal power flow (OPF) problem for power transmission networks is an NP-hard optimization problem with numerous quadratic equality and indefinite quadratic inequality constraints on bus voltages. The existing nonlinear solvers often fail in yielding a feasible solution. In this paper, we follow our previously developed nonsmooth optimization approach to address this difficult large-scale OPF problem, which is an iterative process to generate a sequence of improved solutions that converge to an optimal solution. Each iteration calls an SDP of a moderate dimension. Intensive simulations for OPF over networks with a large number of buses are provided to demonstrate the efficiency of our approach.
Year
DOI
Venue
2016
10.5220/0005921303840389
SMARTGREENS: PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON SMART CITIES AND GREEN ICT SYSTEMS
Keywords
Field
DocType
Optimal Power Flow (OPF),Transmission Networks,Rank-one Matrix Constraint,Nonsmooth Optimization,Semi-Definite Programming (SDP)
Rank (linear algebra),Mathematical optimization,Nonlinear system,Iterative and incremental development,Voltage,Quadratic equation,Power transmission,Optimization problem,Mathematics,Constrained optimization
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
4
Name
Order
Citations
PageRank
Yun Q. Shi12918199.53
Hoang D. Tuan21936191.03
S. W. Su300.34
A. V. Savkin432244.29