Distributed Optimization Over Time-Varying Directed Graphs
نویسندگان
چکیده
منابع مشابه
On the linear convergence of distributed optimization over directed graphs
This paper develops a fast distributed algorithm, termed DEXTRA, to solve the optimization problem when n agents reach agreement and collaboratively minimize the sum of their local objective functions over the network, where the communication between the agents is described by a directed graph. Existing algorithms solve the problem restricted to directed graphs with convergence rates of O(ln k/...
متن کاملDistributed Mirror Descent over Directed Graphs
In this paper, we propose Distributed Mirror Descent (DMD) algorithm for constrained convex optimization problems on a (strongly-)connected multi-agent network. We assume that each agent has a private objective function and a constraint set. The proposed DMD algorithm employs a locally designed Bregman distance function at each agent, and thus can be viewed as a generalization of the well-known...
متن کاملState Emulator-based Adaptive Architectures for Resilient Networked Multiagent Systems over Directed and Time-varying Graphs
In this paper, we present adaptive architectures for networked multiagent systems operating over directed networks to achieve resilient coordination in the presence of disturbances. Specifically, we consider a class of unforeseen adverse conditions consisting of persistent exogenous disturbances and present a state emulator-based distributed adaptive control architecture to retrieve the nominal...
متن کاملA Lie bracket approximation approach to distributed optimization over directed graphs
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 t...
متن کاملDesigning Distributed Fixed-Time Consensus Protocols for Linear Multi-Agent Systems Over Directed Graphs
This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with general linear dynamics over directed communication graphs. By using motion planning approaches, a class of distributed fixed-time consensus algorithms are developed, which rely only on the sampling information at some sampling instants. For linear multi-agent systems, the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2015
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2014.2364096