2017
DOI: 10.1016/j.ifacol.2017.08.1095
|View full text |Cite
|
Sign up to set email alerts
|

Distributed AC Optimal Power Flow using ALADIN * *TF is indebted to the Baden-Württemberg Stiftung for the financial support of this research by the Elite Programme for Postdocs. TF and BH are supported by the Deutsche Forschungsgemeinschaft, Grants WO 2056/1 and WO 2056/4-1. YJ and BH are supported by the National Natural Science Foundation China (NSFC), Nr. 61473185, as well as ShanghaiTech University, Grant-Nr. F-0203-14-012. This work was also supported by the Helmholtz Association under the Joint Init

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…However, the resulting optimization problem is again nonconvex, which makes it much harder to solve. The development of algorithms for this problem is an active field of research; see Erseghe (2014) and Engelmann et al (2017).…”
Section: B Optimal Power Flowmentioning
confidence: 99%
“…However, the resulting optimization problem is again nonconvex, which makes it much harder to solve. The development of algorithms for this problem is an active field of research; see Erseghe (2014) and Engelmann et al (2017).…”
Section: B Optimal Power Flowmentioning
confidence: 99%
“…Distributed control : Requires higher investments, a distributed consensus is performed between all the distributed generators in order to operate (together) optimally the grid, it is more reliable since it could operate even if a given communication line (or DG) goes out of operation (known as single-point failure) (Engelmann et al, 2019(Engelmann et al, , 2017.…”
Section: Tertiary Controlmentioning
confidence: 99%
“…6 and 7. We assume quadratic generator cost functions as in [18] (see Table 3) and one Algorithm 1 ADMM 1: Initialization: Weighting matrix W , tolerance ; for all k ∈ R: initial guesses z k , penalty parameters ρ k = ρ, dual variables λ k = 0, local solutions x k = ∞, local residues Γ k = ∞. 2: while ||Ax|| ∞ > and ||x − z|| ∞ > do 3:…”
Section: Test Scenariomentioning
confidence: 99%