Privacy‐Preserving Optimization Algorithm for Distributed Energy Management Over Time‐Varying Graphs: A State Decomposition Method

ABSTRACT The rapid advancements of intelligent technologies have brought about the potential vulnerability of confidential gradient information linked to cost functions when solving distributed optimization and its related problems. Within the context of distributed energy management, safeguarding such private information has risen to paramount importance. This article investigates a distributed energy management problem (DEMP) to minimize cost while simultaneously satisfying multiple local constraints and protecting the private gradient information of the cost function. To this end, a new privacy‐preserving distributed optimization algorithm under the framework of gradient tracking over time‐varying graphs is proposed for solving the DEMP. Specifically, the auxiliary variables are designed for each node in the algorithm to update the gradient while the original state variables are responsible for the interaction with original neighbors and auxiliary variables. Consequently, the devised algorithm can protect the confidentiality of private cost gradient information, even in the presence of eavesdroppers within the network. In contrast to the homomorphic encryption, signal masking method, and some other algorithms without utilizing the state decomposition, the designed algorithm does not require extra information or computing resources. Moreover, it is proven that the designed algorithm could theoretically converge to the exact optimum of the DEMP at a rate of under some mild assumptions.