2018 Power Systems Computation Conference (PSCC) 2018
DOI: 10.23919/pscc.2018.8442892
|View full text |Cite
|
Sign up to set email alerts
|

Accelerated Methods for the SOCP-Relaxed Component-Based Distributed Optimal Power Flow

Abstract: In light of the increased focus on distributed methods, this paper proposes two accelerated subgradient methods and an adaptive penalty parameter scheme to speed-up the convergence of ADMM on the component-based dual decomposition of the second-order cone programming (SOCP) relaxation of the OPF. This work is the first to apply an adaptive penalty parameter method along with an accelerated subgradient method together in one scheme for distributed OPF. This accelerated scheme is demonstrated to reach substantia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…Nesterov-type acceleration was first proposed in [29] by Nesterov which was originally aimed at accelerating gradient descent-type (first-order) methods. Recently, this technique has been extended to wider applications, such as ADMM-based algorithms [30], gradient tracking-based algorithms [31]. Inspired by these works, the acceleration version of RDDGT with Nesterov momentum named RDDGT-N can be derived where β is the momentum parameter and the x-update is changed to a two-step process:…”
Section: Algorithm Accelerationmentioning
confidence: 99%
“…Nesterov-type acceleration was first proposed in [29] by Nesterov which was originally aimed at accelerating gradient descent-type (first-order) methods. Recently, this technique has been extended to wider applications, such as ADMM-based algorithms [30], gradient tracking-based algorithms [31]. Inspired by these works, the acceleration version of RDDGT with Nesterov momentum named RDDGT-N can be derived where β is the momentum parameter and the x-update is changed to a two-step process:…”
Section: Algorithm Accelerationmentioning
confidence: 99%
“…In order to save communication and computing resource, some methods [28][29][30][31][32][33][34][35][36][37] for constrained optimisation problem were proposed. Guo et al in [29] extended the ADMM [28] to asynchronous framework, which provided a solution for convex optimisation problems in power systems.…”
Section: Introductionmentioning
confidence: 99%
“…Motivated by the works [25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40][41][42][43][44], we introduce an eventtriggered distributed optimisation algorithm to resolve the EDP over time-varying balanced communication networks with timevarying uncoordinated step-sizes. To summarise, the contributions of this work are as follows:…”
Section: Introductionmentioning
confidence: 99%