Abstract
We consider a group of computation units trying to cooperatively solve a distributed optimization problem with shared linear equality and inequality constraints. Assuming that the computation units are communicating over a network whose topology is described by a time-invariant directed graph, by combining saddle-point dynamics with Lie bracket approximation techniques we derive a methodology that allows to design distributed continuous-time optimization algorithms that solve this problem under minimal assumptions on the graph topology as well as on the structure of the constraints. We discuss several extensions as well as special cases in which the proposed procedure becomes particularly simple.
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 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.
