Answers are grounded in this paper and cite their sources.
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> We present distributed algorithms that can be used by multiple agents to align their estimates with a particular value over a network with time-varying connectivity. Our framework is general in that this value can represent a consensus value among multiple agents or an optimal solution of an optimization problem, where the global objective function is a combination of local agent objective functions. Our main focus is on constrained problems where the estimates of each agent are restricted to lie in different convex sets. </para>
No takes yet. Share an insight, caveat, or question.
Nedić et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: