A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization

DOI10.1109/TAC.2013.2281883zbMath1360.90254arXiv1303.6092OpenAlexW2046629409WikidataQ59047401 ScholiaQ59047401MaRDI QIDQ2983262

Mathias Bürger, Frank Allgöwer, Giuseppe Notarstefano

Publication date: 16 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.6092

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Linear programming (90C05)

Related Items

Cooperative fixed-time/finite-time distributed robust optimization of multi-agent systems, Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs, On the stability and convergence of a class of consensus systems with a nonlinear input, Consensus-based Dantzig-Wolfe decomposition, A Unified Framework for Continuous-Time Unconstrained Distributed Optimization, A distributed economic MPC framework for cooperative control under conflicting objectives, Networked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems, Noise-to-State Exponentially Stable Distributed Convex Optimization on Weight-Balanced Digraphs, Approximate cutting plane approaches for exact solutions to robust optimization problems, Multi-agent control: a graph-theoretic perspective, Primal recovery from consensus-based dual decomposition for distributed convex optimization