Name
Abstract | ||
|---|---|---|
Optimal power flow (OPF) over power transmission networks poses challenging large-scale nonlinear optimization problems, which involve a large number of quadratic equality and indefinite quadratic inequality constraints. These computationally intractable constraints are often expressed by linear constraints plus matrix additional rank-one constraints on the outer products of the voltage vectors. The existing convex relaxation technique, which drops the difficult rank-one constraints for tractable computation, cannot yield even a feasible point. We address these computationally difficult problems by an iterative procedure, which generates a sequence of improved points that converges to a rank-one solution. Each iteration calls a semi-definite program. Intensive simulations for the OPF problems over networks with a few thousands of buses are provided to demonstrate the efficiency of our approach. The suboptimal values of the OPF problems found by our computational procedure turn out to be the global optimal value with computational tolerance less than 0.01%. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.sysconle.2018.05.008 | Systems & Control Letters |
Keywords | DocType | Volume |
Optimal power flow (OPF) problem,Large-scale transmission networks,Rank-one matrix constraint,Nonsmooth optimization,Semi-definite programming (SDP) | Journal | 118 |
ISSN | Citations | PageRank |
0167-6911 | 0 | 0.34 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yin Shi | 1 | 337 | 43.06 |
| Hoang D. Tuan | 2 | 1936 | 191.03 |
| Pierre Apkarian | 3 | 635 | 108.90 |
| Andrey V. Savkin | 4 | 1431 | 178.60 |