Abstract
AbstractThe distributed time‐varying constrained convex optimization problem over a connected undirected network topology is studied in this article. The proposed distributed optimization algorithm is composed of a projection map term, a consensus term, and a gradient term, and is feasible for any initial condition. We first show that the states of the optimization algorithm uniformly converge to a neighborhood of the constraint set while an approximate global consensus is achieved. Then the states are proven to uniformly converge to a neighborhood of the time‐varying optimal trajectory. The theoretical results are validated by some simulations.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Robust and Nonlinear Control
Disclaimer: 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.
