Manufacturing Consent

dc.contributor.authorBorkar, V.S.
dc.contributor.authorKarnik, A.
dc.contributor.authorNair, J.
dc.contributor.authorNalli, S.
dc.date.accessioned2026-02-05T09:34:02Z
dc.date.issued2015
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.
dc.identifier.citationIEEE Transactions on Automatic Control, 2015, 60, 1, pp. 104-117
dc.identifier.issn189286
dc.identifier.urihttps://doi.org/10.1109/TAC.2014.2349591
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/26388
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectAlgorithms
dc.subjectCombinatorial optimization
dc.subjectConvex optimization
dc.subjectElectric network parameters
dc.subjectNonlinear programming
dc.subjectOptimal control systems
dc.subjectCombinatorial optimization problems
dc.subjectCritical phenomenon
dc.subjectDynamic adjustment
dc.subjectNonconvex optimization
dc.subjectOptimal control problem
dc.subjectOptimization problems
dc.subjectParametric optimization
dc.subjectProgramming relaxations
dc.subjectOptimization
dc.titleManufacturing Consent

Files

Collections