Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
DOI10.1109/TAC.2012.2215261zbMath1369.93049arXiv1112.1333WikidataQ60432144 ScholiaQ60432144MaRDI QIDQ5353138
Karl Henrik Johansson, Yiguang Hong, Guo-Dong Shi
Publication date: 8 September 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.1333
Convex programming (90C25) Feedback control (93B52) Approximation methods and heuristics in mathematical programming (90C59) Decentralized systems (93A14) Optimality conditions for problems involving relations other than differential equations (49K21) Agent technology and artificial intelligence (68T42)
Related Items (44)
This page was built for publication: Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets