Abstract
Inspired by the distributed economic dispatch problem (EDP) in power system, this paper considers a problem of optimizing a sum of m local convex cost functions on an undirected network of m agents. Each agent in the network privately knows its own local convex objective function and is subjected to both coupling linear constraint and individual box constraints. To be able to reduce the requirements for information exchange among agents, we propose a novel fully event-triggered based distributed primal-dual algorithm for the convex optimization problem. Our algorithm allows the use of uncoordinated step-sizes and assumes that each agent communicates with its neighboring agents (the corresponding variables are updated) only at some independent event-triggered sampling time instants. Under some relatively standard assumptions (strong convexity and smoothness) on the objective functions, our theoretical analysis proves that the proposed algorithm can linearly seek the exact optimal solution when the upper bound of the uncoordinated step-sizes is smaller than a certain constant. We also conduct a clear estimate of the rate. Finally, a simple numerical example on distributed economic dispatch problem in power system is provided to illustrate the effectiveness of our event-triggered based optimization algorithm and validate the correctness of the analysis process.
Highlights
In recent years, distributed convex optimizations of multi-agent system are becoming the hot issues in the field of engineering
NUMERICAL SIMULATION RESULTS we give a simulation example on economic dispatch problem in power system to verify the effectiveness of our event-triggered distributed primal-dual optimization algorithm
We use the IEEE 14-bus system to study the economic dispatch problem (EDP) which is the main concern of our paper
Summary
In recent years, distributed convex optimizations of multi-agent system are becoming the hot issues in the field of engineering. The applications in these engineering areas include distributed parameter estimation in wireless sensor networks [1], big data distributed processing [2], power system control [3], resource allocation [4], etc. It is not completely practical to use traditional technology to achieve the optimal solution. In this context, we need to develop more high-efficiency distributed optimization methods to handle complex convex optimization problems
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
