Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/12135
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBorkar, V.S.
dc.contributor.authorKarnik, A.
dc.contributor.authorNair, J.
dc.contributor.authorNalli, S.
dc.date.accessioned2020-03-31T08:38:42Z-
dc.date.available2020-03-31T08:38:42Z-
dc.date.issued2015
dc.identifier.citationIEEE Transactions on Automatic Control, 2015, Vol.60, 1, pp.104-117en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12135-
dc.description.abstractWe 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.en_US
dc.titleManufacturing Consenten_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.