pith. sign in

arxiv: 1803.00077 · v1 · pith:XQ7IID4Nnew · submitted 2018-02-28 · 🧮 math.OC

Distributed Synthesis Using Accelerated ADMM

classification 🧮 math.OC
keywords synthesisdistributedacceleratedadmmdisturbancesgiveninterconnectionlocal
0
0 comments X
read the original abstract

We propose a convex distributed optimization algorithm for synthesizing robust controllers for large-scale continuous time systems subject to exogenous disturbances. Given a large scale system, instead of solving the larger centralized synthesis task, we decompose the problem into a set of smaller synthesis problems for the local subsystems with a given interconnection topology. Hence, the synthesis problem is constrained to the sparsity pattern dictated by the interconnection topology. To this end, for each subsystem, we solve a local dissipation inequality and then check a small-gain like condition for the overall system. To minimize the effect of disturbances, we consider the $\mathrm{H}_\infty$ synthesis problems. We instantiate the distributed synthesis method using accelerated alternating direction method of multipliers (ADMM) with convergence rate $O(\frac{1}{k^2})$ with $k$ being the number of iterations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.