The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A Fully Distributed Reactive Power Optimization and Control Method for Active Distribution Networks
Open accessAbstract
This paper presents a fully distributed reactive power optimization algorithm that can obtain the global optimum solution of nonconvex problems for distribution networks (DNs) without requiring a central coordinator. Second-order conic relaxation is used to achieve exact convexification. A fully distributed second-order cone programming solver (D-SOCP) is formulated corresponding to the given division of areas based on the alternating direction method of multipliers (ADMM) algorithm, which is greatly simplified by exploiting the structure of active DNs. The problem is solved for each area with very little interchange of boundary information between neighboring areas. D-SOCP is extended by using a varying penalty parameter to improve convergence. A proof of its convergence is also given. The effectiveness of the method is demonstrated via numerical simulations using the IEEE 69-bus, 123-bus DNs, and a real 1066-bus distribution system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Network reconfiguration in distribution systems for loss reduction and load balancing
Baran, M. E., & Wu, F. F. (1989) · IEEE Transactions on Power Delivery · doi:10.1109/61.25627 · Cited by 5,077
Network Reconfiguration in Distribution Systems for Loss Reduction and Load Balancing
Baran, M. E., & Wu, F. F. (1989) · IEEE Power Engineering Review · doi:10.1109/mper.1989.4310642 · Cited by 3,350
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Optimal capacitor placement on radial distribution systems
Baran, M. E., & Wu, F. F. (1989) · IEEE Transactions on Power Delivery · doi:10.1109/61.19265 · Cited by 2,062 · cited 1×
“1, a radial network was used as an example to illustrate the Distflow branch equations [22], [23].”
MethodRadial distribution test feeders
Kersting, W. H. (1991) · IEEE Transactions on Power Systems · doi:10.1109/59.119237 · Cited by 1,888
Branch Flow Model: Relaxations and Convexification—Part I
Farivar, M., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2255317 · Cited by 1,541 · cited 5×
“This SOCP relaxation is exact for radial networks [13].”
BackgroundMethodInfluentialAlizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Cited by
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Antoniadou-Plytaria, K. E., Kouveliotis-Lysikatos, I. N., Georgilakis, P. S., & Hatziargyriou, N. D. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2679238 · Cited by 545
“SOCP relaxation and an ADMM algorithm with tunable parameters are employed in [39] for voltage-constrained reactive power flow optimization with the aim to minimize losses; however, simulations showed that voltage regulation at the substation was necessary to ensure operation within limits.”
MethodSun, X., & Qiu, J. (2021) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2021.3052998 · Cited by 289
Chai, Y., Guo, L., Wang, C., Zhao, Z., Du, X., & Pan, J. (2018) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2018.2813400 · Cited by 265
Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow
Zamzam, A. S., & Baker, K. (2020) · 2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) · doi:10.1109/smartgridcomm47815.2020.9303008 · Cited by 206
Li, S., Wu, W., & Lin, Y. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3166274 · Cited by 54
Self-citationData-driven combined central and distributed volt/var control in active distribution networks
Sun, X., Qiu, J., Tao, Y., & Zhao, J. (2023) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3213587 · Cited by 42
Li, B., & Xu, Q. (2024) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2023.3279303 · Cited by 31
Cao, D., Hu, J., Liu, Y., & Hu, W. (2024) · IEEE Transactions on Reliability · doi:10.1109/tr.2024.3354938 · Cited by 14
Self-citationA dual time scale Voltage/Var control method for active distribution networks based on data-driven
Li, H., Su, P., Wang, C., Yue, Z., Wang, Z., & Wang, C. (2025) · Electrical Engineering · doi:10.1007/s00202-024-02576-5 · Cited by 5
Metadata
- Authors
- Zheng, W., Wu, W., Zhang, B., Sun, H., & Liu, Y.
- Venue
- IEEE Transactions on Smart Grid
- Published
- 2015
- Pages
- 1-1
- ISSN
- 1949-3053 (ISSN-L)
- 1949-3061
- OpenAlex
- W2002154164
- Cited by
- 371
- References
- 27
- FWCI
- 11.71
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.