Name
Abstract | ||
|---|---|---|
We consider a variant of the gossip algorithm wherein a controller can influence the values at a subset of nodes as well as the averaging weights. This leads to three optimization problems: (i) Optimal choice of nodes: a combinatorial optimization problem for which we propose a nonlinear programming relaxation as well as a greedy heuristic; (ii) Parametric optimization of weights: a non-convex optimization for which we propose an effective heuristic for a special case; (iii) Dynamic adjustment of weights: an optimal control problem. For the dynamic case, we note some empirically observed interesting critical phenomena for the uncontrolled case. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TAC.2014.2349591 | IEEE Trans. Automat. Contr. |
Keywords | DocType | Volume |
Optimization,Convergence,Social network services,Optimal control,Markov processes,Heuristic algorithms,Greedy algorithms | Journal | 60 |
Issue | Citations | PageRank |
1 | 2 | 0.39 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vivek S. Borkar | 1 | 974 | 142.14 |
| Aditya Karnik | 2 | 303 | 17.62 |
| Jayakrishnan Nair | 3 | 72 | 20.59 |
| Sanketh Nalli | 4 | 2 | 0.39 |