438 citations · 1k across the 57 of their papers we have counts for
8 papers · 1 filter
Accelerated Gradient Methods for Networked Optimization
Euhanna Ghadimi, Iman Shames, Mikael Johansson
We develop multi-step gradient methods for network-constrained optimization of strongly convex functions with Lipschitz-continuous gradients. Given the topology of the underlying n…
How Agreement and Disagreement Evolve over Random Dynamic Networks
Guodong Shi, Mikael Johansson, Karl Henrik Johansson
The dynamics of an agreement protocol interacting with a disagreement process over a common random network is considered. The model can represent the spreading of true and false in…
A Regularized Saddle-Point Algorithm for Networked Optimization with Resource Allocation Constraints
Andrea Simonetto, Tamas Keviczky, Mikael Johansson
We propose a regularized saddle-point algorithm for convex networked optimization problems with resource allocation constraints. Standard distributed gradient methods suffer from s…
Finite-time Convergent Gossiping
Guodong Shi, Bo Li, Mikael Johansson +1
Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social netw…
Distributed Output-Feedback LQG Control with Delayed Information Sharing
Hamid Reza Feyzmahdavian, Ather Gattami, Mikael Johansson
This paper develops a controller synthesis method for distributed LQG control problems under output-feedback. We consider a system consisting of three interconnected linear subsyst…
Modular design of jointly optimal controllers and forwarding policies for wireless control
Burak Demirel, Zhenhua Zou, Pablo Soldati +1
We consider the joint design of packet forwarding policies and controllers for wireless control loops where sensor measurements are sent to the controller over an unreliable and en…
Randomized Gossip Algorithm with Unreliable Communication
Guodong Shi, Mikael Johansson, Karl Henrik Johansson
In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When…
Contractive Interference Functions and Rates of Convergence of Distributed Power Control Laws
Hamid Reza Feyzmahdavian, Mikael Johansson, Themistoklis Charalambous
The standard interference functions introduced by Yates have been very influential on the analysis and design of distributed power control laws. While powerful and versatile, the f…