Manufacturing Consent
No Thumbnail Available
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers Inc.
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. © 1963-2012 IEEE.
Description
Keywords
Algorithms, Combinatorial optimization, Convex optimization, Electric network parameters, Nonlinear programming, Optimal control systems, Combinatorial optimization problems, Critical phenomenon, Dynamic adjustment, Nonconvex optimization, Optimal control problem, Optimization problems, Parametric optimization, Programming relaxations, Optimization
Citation
IEEE Transactions on Automatic Control, 2015, 60, 1, pp. 104-117