A Privacy-Preserving Distributed Control of Optimal Power Flow
Not on the map. Why?
Abstract (arXiv)
We consider a distributed optimal power flow formulated as an optimization problem that maximizes a nondifferentiable concave function. Solving such a problem by the existing distributed algorithms can lead to data privacy issues because the solution information exchanged within the algorithms can be utilized by an adversary to infer the data. To preserve data privacy, in this paper we propose a differentially private projected subgradient (DP-PS) algorithm that includes a solution encryption step. We show that a sequence generated by DP-PS converges in expectation, in probability, and with probability 1. Moreover, we show that the rate of convergence in expectation is affected by a target privacy level of DP-PS chosen by the user. We conduct numerical experiments that demonstrate the convergence and data privacy preservation of DP-PS.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Feb 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1.
4 papers.
- 2022APPFL: Open-Source Software Framework for Privacy-Preserving Federated Learningcited by 20
- 2021A Reinforcement Learning Approach to Parameter Selection for Distributed Optimal Power Flowcited by 5
- 2021Realistic Differentially-Private Transmission Power Flow Data Releasecited by 0
- 2023Differentially Private Distributed Convex Optimizationcited by 0
- 2023Differentially Private Distributed Convex Optimization28 Feb 2023
- 2022APPFL: Open-Source Software Framework for Privacy-Preserving Federated Learning8 Feb 2022
- 2021A Reinforcement Learning Approach to Parameter Selection for Distributed Optimal Power Flow22 Oct 2021
- 2021Realistic Differentially-Private Transmission Power Flow Data Release25 Mar 2021