A multi-block alternating direction method with parallel splitting for decentralized consensus optimization
- Qing Ling^{1}Email author,
- Min Tao^{2},
- Wotao Yin^{3} and
- Xiaoming Yuan^{4}
DOI: 10.1186/1687-1499-2012-338
© Ling et al.; licensee Springer. 2012
Received: 15 February 2012
Accepted: 5 October 2012
Published: 12 November 2012
Abstract
Decentralized optimization has attracted much research interest for resource-limited networked multi-agent systems in recent years. Decentralized _{T}consensus optimization, which is one of the decentralized optimization problems of great practical importance, minimizes an objective function that is the sum of the terms from individual agents over a set of variables on which all the agents should reach a consensus. This problem can be reformulated into an equivalent model with two blocks of variables, which can then be solved by the alternating direction method (ADM) with only communications between neighbor nodes. Motivated by a recently emerged class of so-called multi-block ADMs, this article demonstrates that it is more natural to reformulate a decentralized consensus optimization problem to one with multiple blocks of variables and solve it by a multi-block ADM. In particular, we focus on the multi-block ADM with parallel splitting, which has easy decentralized implementation. Convergence rate is analyzed in the setting of average consensus, and the relation between two-block and multi-block ADMs are studied. Numerical experiments demonstrate the effectiveness of the multi-block ADM with parallel splitting in terms of speed and communication cost and show that it has better network scalability.
Introduction
In recent years, the communication, signal processing, control, and optimization communities have witnessed considerable research efforts on decentralized optimization for networked multi-agent systems [1–3]. A networked multi-agent system, such as a wireless sensor network (WSN) or a networked control system (NCS), is composed of multiple geographically distributed but interconnected agents which have sensing, computation, communication, and actuating abilities. This system generally has limited resources for communication, since battery power is limited and recharging is difficult, while communication between two agents is energy-consuming. Furthermore, the communication link is often vulnerable and bandwidth-limited. In this situation, decentralized optimization emerges as an effective approach to improve network scalability. In decentralized optimization, data and computation are decentralized. Each agent exchanges information with its neighbors and accomplishes an otherwise centralized optimization task.
where ${f}_{i}\left(x\right):{\mathcal{R}}^{N}\to \mathcal{R}$ is a convex function known to agent i only. The goal is to minimize the objective subject to consensus on x.
Related study
The decentralized consensus optimization formulation (1) arises in many practical applications, such as averaging [9–11], estimation [12–17], learning [18–21], etc. The form of f_{ i }(x) can be least squares [11–13], ℓ_{1}-regularized least squares [14–17], or more general ones [18–21]. Note that this model can be extended to account for those with separable constraints, such as the network utility maximization (NUM) problem [22–24].
Existing approaches to solving (1) include: i) belief propagation based on graphical models and Markovian random fields [18–20]; ii) incremental optimization which minimizes the overall objective function along a predefined path on the network [7, 8]; iii) stochastic optimization with information exchange between neighboring agents [4–6]; and iv) optimization with explicit consensus constraints which can be handled with the alternating direction method (ADM) [3, 12–17]. The ADM approach is fully decentralized, does not make any assumptions on network infrastructure such as free of loop or with a predefined path, and generally has satisfactory convergence performance. In this article, we mainly discuss the application of ADMs in the decentralized consensus optimization problem.
Our research is along the line of information-driven signal processing and control of WSNs and NCSs [24–26]. Accompanied with the unprecedented data collection abilities offered by large-scale networked multi-agent systems, a new challenge also arises: how should we process such a large amount of data to make estimates and produce control strategies given limited network resources? Instead of processing the data in a fusion center, our solution is letting each agent autonomously make decisions aided by limited communication with its neighbors. From this perspective, each individual objective function f_{ i }(x) in (1) is constructed from the data collected by agent i, and x is the global information common to all agents (e.g., estimates or control strategies) obtained based on the data collected by the whole network. Though this framework can be generalized to various signal processing and control problems, this article focuses on those can be formulated as (1). For problems such as dynamic control and Kalman filtering of networked multi-agent systems, interested readers are referred to [1, 2, 27, 28], respectively.
Our contribution
Motivated by a series of recent articles on multi-block ADMs and their convergence analysis [29–31], this article describes their applications to the decentralized consensus optimization problem. The multi-block ADM with parallel spliting is reviewed in Section 3. Unlike the classical ADM (see textbooks [32, 33]), this multi-block ADM splits the optimization variables into multiple blocks and sequentially updates just one of them while fixing the others. The classical ADM, on the other hand, only has two blocks of variables. Hence in this article we refer to it by the two-block ADM. Our problem (1) does not naturally have two distinct blocks of variables, and to apply the two-block ADM one needs to introduce extra variables (see e.g., [15, 16, 32]). We review this in Section 2. On the other hand, it is simpler to apply the multi-block ADM to (1) and the resulting algorithm is readily decentralized.
In this article also analyzes the convergence rate of the multi-block ADM applied to the average consensus problem, which is a special case of (1) where ${f}_{i}\left(x\right)=\frac{1}{2}\parallel x-{b}_{i}{\parallel}_{2}^{2}$ for all i. In this setting, if the parameters of the multi-block ADM satisfy a certain formula, it is equivalent to the two-block ADM. Therefore, the two-block ADM can be considered as a special case of the multi-block ADM on average consensus problems. This relation also gives a guideline to select the parameters of the multi-block ADM so that it is not equivalent to and runs faster than the two-block ADM on all the tested decentralized consensus optimization problems, including the tested average consensus problems. The simulation results demonstrate that the multi-block ADM accelerates convergence, reduces communication cost, and thus improves network scalability.
Paper organization
The rest of this article is organized as follows. Section 2 reviews a reformulation of the decentralized consensus optimization problem (1), to which the two-block ADM is applied. Section 3 reviews the multi-block ADM and applies a parallel-splitting version of it to (1). Section 4 elaborates on the convergence rate analysis on the average consensus problem, and shows that the two-block ADM is a special case of the multi-block ADM in this case. Section 5 presents numerical simulations of the two-block and multi-block ADMs. Finally, Section 6 concludes the article. Appendix Appendix 1 is placed in the last section.
Problem formulation and the two-block ADM
In this section, we describe an equivalent formulation of the decentralized consensus optimization problem (1) and outline the algorithm design based on the two-block ADM.
Problem formulation
We consider a networked multi-agent system described by an undirected connected communication graph $\mathcal{G}=(\mathcal{L},\mathcal{E})$, where $\mathcal{L}$ is the set of L vertexes (distributed agents) and $\mathcal{E}$ is the set of edges (communication links). There exists an edge $(i,j)\in \mathcal{E}$ between agents i and j if they can directly communicate with each other. The two agents are also called one-hop neighbors, or simply neighbors. The set of one-hop neighbors of agent i is denoted by ${\mathcal{N}}_{i}$, whose cardinality is denoted by $\left|{\mathcal{N}}_{i}\right|$.
The two-block ADM
The two-block ADM guarantees global convergence for any c > 0 [32]. More precisely, when each g_{ i } is convex for i = 1 and 2, the dual sequence {λ(t)} converges to an optimal dual solution of (5); if further the primal sequence {θ_{1}(t)^{ T }θ_{2}(t)^{ T }^{ T }} is bounded, the sequence converges to an optimal primal solution of (5).
The two-block ADM for decentralized consensus optimization
Here z_{ ij } is an auxiliary variable attached to x^{(i)}and x^{(j)}.
Treating {x^{(i)}} and {z_{ ij }} as two blocks of variables, the two-block ADM is applied to problem (4). This technique has been adopted in [15, 16] to solve the decentralized consensus optimization problem with neighboring consensus constraints. After eliminating {z_{ ij }} from the iterative updates and further simplifications, the two-block ADM for (4) is given below as algorithm TB-ADM.
Initialization: Each agent i initializes x^{(i)}(0)=0 and α_{ i }(0)=0.
Step 1: At time t, each agent i updates its local copy x^{(i)}as: ${x}^{\left(i\right)}(t+1)=arg\underset{{x}^{\left(i\right)}}{min}\phantom{\rule{1em}{0ex}}{f}_{i}\left({x}^{\left(i\right)}\right)+\underset{i}{\overset{T}{\alpha}}\left(t\right){x}^{\left(i\right)}+c\sum _{j\in {\mathcal{N}}_{i}}\left|\right|{x}^{\left(i\right)}-\frac{1}{2}\left({x}^{\left(i\right)}\left(t\right)+{x}^{\left(j\right)}\left(t\right)\right)|\underset{2}{\overset{2}{|}}$, where α_{ i }is the Lagrange multiplier and c is a positive constant.
Step 2: At time t, each agent i updates its Lagrange multiplier α_{ i }as: ${\alpha}_{i}(t+1)={\alpha}_{i}\left(t\right)+c\left|{\mathcal{N}}_{i}\right|{x}^{\left(i\right)}(t+1)-c\sum _{j\in {\mathcal{N}}_{i}}{x}^{\left(j\right)}(t+1)$.
Step 3: Repeat Step 1 and Step 2 until convergence.
TB-ADM is well suited for decentralized computation since the updates require only communication between agents i and j, who are one-hop neighbors. Detailed derivation of TB-ADM can be found in [15, 16, 32].
The multi-block ADM
The fact that many practical optimization problems naturally have multiple blocks of variables motivates the development of a class of multi-block ADMs, such as the one with parallel splitting [29], with prediction-correction [30], and with Gaussian back substitution [31]. Due to the nature of the decentralized consensus optimization problem (2) and the need of parallelization, we choose the multi-block ADM with parallel splitting in [29].
The multi-block ADM with parallel splitting
The multi-block ADM guarantees global convergence if the two positive constants β and μ are properly chosen. For the convergence proof and the settings of β and μ, the interested reader is referred to [29].
The multi-block ADM for decentralized consensus optimization
Applying the multi-block ADM in (2) directly gets a decentralized algorithm, and does not need to introduce a new block of auxiliary variables and eliminate them, as we have done in the two-block ADM. We provide the algorithm to solve (2) based on the multi-block ADM with parallel splitting, denoted as MB-ADM. Detailed derivation of MB-ADM is given in Appendix Appendix 1.
Initialization: Each agent i initializes q_{ i }(0)=0, x^{(i)}(0)=0, and λ_{ i }(0)=0.
Step 1: At time t, each agent i updates its auxiliary variable q_{ i }as: ${q}_{i}(t+1)={\lambda}_{i}\left(t\right)+\beta \left|{\mathcal{N}}_{i}\right|{x}^{\left(i\right)}\left(t\right)-\beta \sum _{j\in {\mathcal{N}}_{i}}{x}^{\left(j\right)}\left(t\right)$, where β is a positive constant.
Step 2: At time t, each agent i updates its local copy x^{(i)}as: ${x}^{\left(i\right)}(t+1)=arg\underset{{x}^{\left(i\right)}}{min}\phantom{\rule{2.77695pt}{0ex}}\phantom{\rule{2.77695pt}{0ex}}{f}_{i}\left({x}^{\left(i\right)}\right)+2\underset{i}{\overset{T}{q}}(t+1){x}^{\left(i\right)}+\mu \left|{\mathcal{N}}_{i}\right|\left|\right|{x}^{\left(i\right)}-{x}^{\left(i\right)}\left(t\right)|\underset{2}{\overset{2}{|}}$, where μ is a positive constant.
Step 3: At time t, each agent i updates its Lagrange multiplier λ_{ i }as: ${\lambda}_{i}(t+1)={\lambda}_{i}\left(t\right)+\beta \left|{\mathcal{N}}_{i}\right|{x}^{\left(i\right)}(t+1)-\beta \sum _{j\in {\mathcal{N}}_{i}}{x}^{\left(j\right)}(t+1)$.
Step 4: Repeat Step 1 to Step 3 until convergence.
In each iteration, to update q_{ i }(t + 1) and λ_{ i }(t), agent i needs x^{(j)}(t) with the size of N×1 from all neighbors $j\in {\mathcal{N}}_{i}$; to optimize x^{(i)}(t + 1), agent i only needs local information q_{ i }(t + 1) and x^{(i)}(t). In all, each agent only needs to broadcast an N×1 vector of its local copy (i.e., x^{(i)}(t)) to its neighbors per iteration. MB-ADM and TB-ADM have the same per-iteration communication cost. At the t th iteration, agent i needs to update x^{(i)}(t), q_{ i }(t), and λ_{ i }(t) in its memory for MB-ADM. Hence the memory requirement is slightly higher than that of TB-ADM, for which only x^{(i)}(t) and α_{ i }(t) need to be updated.
Convergence rate analysis
Convergence rate is an significant issue for decentralized algorithms, since it directly influences the overall communication cost. With respect to general separable convex programs, [29, 34] proves the sublinear convergence rates of $\sim \frac{1}{t}$ for the multi-block and two-block ADMs, respectively. However, when they are applied to the average consensus problems, much faster convergence can be observed. For this reason, we improve the convergence rate in this section.
The average consensus problem gives rise to problem (2) with ${f}_{i}\left({x}^{\left(i\right)}\right)=\frac{1}{2}\left|\right|{x}^{\left(i\right)}-{b}_{i}|{|}_{2}^{2},\forall i$[9–11]; namely, agents aims at averaging their original measurements {b_{ i }} via one-hop communication. Without loss of generality, we assume that x^{(i)} and b_{ i } are both scalars since their dimensions have no effect on the convergence rate.
Convergence rate of MB-ADM
In analyzing the convergence rate of MB-ADM for the average consensus problem, we first rewrite MB-ADM as a state transition equation form and then use the spectral analysis tools to provide a bound of convergence rate. Our train of thought is similar to that in [35] for the two-block ADM.
with Γ_{ M } being an L×L matrix whose (i,i)th entry is $\frac{1-4\beta \left|{\mathcal{N}}_{i}\right|+4\mu \left|{\mathcal{N}}_{i}\right|}{1+2\mu \left|{\mathcal{N}}_{i}\right|}$ and (i,j)th entry is $\frac{4\beta}{1+2\mu \left|{\mathcal{N}}_{i}\right|}$ if i and j are neighbors, and Ω_{ T }being an L×L matrix whose (i,i)th entry is $\frac{2\beta \left|{\mathcal{N}}_{i}\right|-2\mu \left|{\mathcal{N}}_{i}\right|}{1+2\mu \left|{\mathcal{N}}_{i}\right|}$ and (i,j)th entry is $-\frac{2\beta}{1+2\mu \left|{\mathcal{N}}_{i}\right|}$ if i and j are neighbors. We can see that summation of each row of Φ_{ M }is 1. The initial state is ${s}_{M}\left(1\right)=[\frac{{b}_{1}}{1+2\mu \left|{\mathcal{N}}_{1}\right|},\dots ,\frac{{b}_{L}}{1+2\mu \left|{\mathcal{N}}_{L}\right|},0,\dots ,0]$ when each agent i initializes q_{ i }(0)=0, x^{(i)}(0)=0, and λ_{ i }(0)=0.
Proposition 1
(convergence and convergence rate of MB-ADM on average consensus) The state transition equation (6) defined above has the following properties:
Property 1
respectively. Note that l_{M 1} and r_{M 1} are chosen subject to l_{M 1}r_{M 1}=1.
Property 2
Proof of Property 1 is given in Appendix Appendix 1. Property 2 comes from the classical convergence rate analysis of state transition equations. If ρ_{M 1}=1 and ρ_{ M }<1, then there exists a unique ${s}_{M}\left(\infty \right)$ and the convergence rate is $\left|\right|{s}_{M}(t+1)-{s}_{M}\left(\infty \right)|{|}_{2}\sim {t}^{({\kappa}_{M}-1)}{\rho}_{M}^{t}$ (see [36], Fact 3). Next we try to find one possible (and hence unique) ${s}_{M}\left(\infty \right)$. By definition, Φ_{ M }r_{M 1}=ρ_{M 1}r_{M 1}=r_{M 1}. Hence $\underset{t\to \infty}{lim}{\Phi}_{M}^{t}{r}_{M1}={r}_{M1}$. Similarly, $\underset{t\to \infty}{lim}{l}_{M1}{\Phi}_{M}={l}_{M1}$. These two facts mean that r_{M 1}l_{M 1} is a possible limit point of $\underset{t\to \infty}{lim}{\Phi}_{M}^{t}$. Therefore, r_{M 1}l_{M 1}s_{ M }(1) is a possible (and hence unique) limit point of ${s}_{M}\left(\infty \right)$.
Remark 1
Note that the $\sim {t}^{({\kappa}_{M}-1)}{\rho}_{M}^{t}$ rate, though still loose, is tighter than the $\sim \frac{1}{t}$ rate of the multi-block ADM for general separable convex programs [29]. Indeed, from numerical experiments, we find that κ_{ M }, the size of the largest Jordan block of Φ_{ M }, is often equal to 1 (it means that Φ_{ M }is diagonalizable). In this case, the convergence rate can be as fast as $\sim {\rho}_{M}^{t}$.
In Property 2, there is a condition that ρ_{ M }<1. It is not necessarily for true any choices of μ and β. Next we show two nontrivial special cases where the condition in Property 2 satisfy. The first special case connects MB-ADM with TB-ADM. Analysis of these two special cases as well as numerical simulations provide guidelines for parameter selection in MB-ADM.
Proposition 2
(two nontrivial special cases) We have ρ_{ M }<1 in either one of the following two cases: Case 1: The parameters μ and β are chosen such that μ = 2β > 0; further, $\frac{2\beta \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{4}$ and $\frac{2\mu \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{2}$ for all j=1,2,…,L. Case 2: The parameters μ and β are chosen such that μ=β>0; further, $\frac{2\beta \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{2}$ and $\frac{2\mu \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{2}$ for all j=1,2,…,L.
Remark 2
The proof of Proposition 2 is given in Appendix Appendix 1. In case 1, we set μ=2β>0, which indeed leads to the equivalence between MB-ADM and TB-ADM, as we will show in the next subsection. In case 2, we set μ=β>0, which brings faster convergence for the average consensus problem according to numerical simulations (see Section 5.2). Hence we recommend to set β=τμ with a fixed ratio $\frac{1}{2}\le \tau \le 1$, and just tune the value of μ. This setting also works well for the general decentralized consensus optimization problem (1). Tuning μ for MB-ADM is similar to tuning c for TB-ADM; both algorithms have 1 parameter subject to the user choice. Note that the conditions in Proposition 2 are merely sufficient; $\frac{2\beta \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}$ and $\frac{2\mu \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}$ can be larger than their upper bounds given above.
Connection between MB-ADM and TB-ADM
To show the connection between MB-ADM and TB-ADM, we also write TB-ADM as a state transition equation form. Note that [35] considers another kind of two-block ADM for the average consensus problem, where consensus constraints are quadratically penalized by different weights in the augmented Lagrangian function. In TB-ADM, the consensus constraints are quadratically penalized by the same weight c.
with I_{L×L} being the L×L identity matrix, 0_{L×L} being the L×L zero matrix, Γ_{ T } being an L×L matrix whose (i,i)th entry is 1 and (i,j)th entry is $\frac{2c}{1+2c\left|{\mathcal{N}}_{i}\right|}$ if i and j are neighbors, and Ω_{ T }being an L×L matrix whose (i,i)th entry is $-\frac{c\left|{\mathcal{N}}_{i}\right|}{1+2c\left|{\mathcal{N}}_{i}\right|}$ and (i,j)th entry is $-\frac{c}{1+2c\left|{\mathcal{N}}_{i}\right|}$ if i and j are neighbors. The initial state is ${s}_{T}\left(1\right)=[\frac{{b}_{1}}{1+2c\left|{\mathcal{N}}_{1}\right|},\dots ,\frac{{b}_{L}}{1+2c\left|{\mathcal{N}}_{L}\right|},0,\dots ,0]$ when each agent i initializes x^{(i)}(0)=0 and α_{ i }(0)=0.
Comparing the state transition equations of MB-ADM and TB-ADM, we can find that TB-ADM is indeed a special case of MB-ADM when c=μ=2β>0. In this sense, MB-ADM provides more flexibility in parameter selection than TB-ADM. According to our simulations in Section 5.2, setting β=τμ with $\frac{1}{2}\le \tau \le 1$ makes MB-ADM faster than TB-ADM.
and denoting κ_{ T } as the size of the largest Jordan block of Φ_{ T }, we can prove that TB-ADM has a similar $\sim {t}^{({\kappa}_{T}-1)}{\rho}_{T}^{t}$ convergence rate to the optimal solution given the conditions in Case 1 of Proposition 2. Interestingly, the upper bounds of $\frac{2c\left|{\mathcal{N}}_{j}\right|}{1+2c\left|{\mathcal{N}}_{j}\right|}<\frac{1}{2}$ for all j=1,2,…,L are no longer needed since TB-ADM guarantees global convergence for any c>0.
Numerical Experiments
In this section, we present numerical simulations and demonstrate the performance of MB-ADM on the decentralized consensus optimization problems. Particularly, we are interested in how the communication cost scales to the network size.
Simulation Settings
In the numerical experiments, we consider the case that the agents cooperatively solve a least-squares problem. Each agent i has a measurement matrix ${A}_{i}\in {\mathcal{R}}^{M\times N}$ and a measurement vector ${b}_{i}\in {\mathcal{R}}^{M}$. The objective function in (1) is thus $f\left(x\right)=\sum _{i=1}^{L}{f}_{i}\left(x\right)=\frac{1}{2}\sum _{i=1}^{L}\left|\right|{A}_{i}x-{b}_{i}|{|}_{2}^{2}$. The elements of the true signal vector x_{0} and the entries of the measurement matrices {A_{ i }} follow the normal distribution $\mathcal{N}(0,1)$. The measurement vector b_{ i }=A_{ i }x_{0} + η_{ i }; the elements of the noise vector η_{ i }follow the normal distribution $\mathcal{N}(0,0.1)$. In the tests of average consensus, {A_{ i }} reduce to identity matrices and are no longer random.
In the simulation, we assume that L agents are uniformly randomly deployed in a 100×100 area. All agents have a common communication range r_{ C }, which is chosen such that the networked multi-agent system is connected. Given r_{ C }, the average node degree d can be calculated. We consider the following three scenarios: # 1) L=50, M=1, N=1, {A_{ i }=1}, r_{ C }=30, d≃12; # 2) L=50, M=10, N=5, r_{ C }=30, d≃12; # 3) L=200, M=10, N=5, r_{ C }=15, d≃12. Scenario # 1 is the average consensus test. Throughout the simulations, we set β=τμ in MB-ADM with τ=0. 9.
Convergence rate for average consensus
According to the theoretical analysis in Sections 4.1 and 4.2, the estimated convergence rates of MB-ADM and TB-ADM are $\sim {t}^{({\kappa}_{M}-1)}{\rho}_{M}^{t}$ and $\sim {t}^{({\kappa}_{T}-1)}{\rho}_{T}^{t}$, respectively. However, numerical simulations show that they are loose bounds; the actual convergence rate, as we can observe from Figure 2, are linear.
Performance Comparison
What of particular interest to us is whether the decentralized algorithms are scalable to network size. Observing Figure 3 with L=50 agents and d≃12, and Figure 4 with L=200 agents and d≃12, we can find that the convergence rates of the two algorithm are more dependent on the average node degree other than on the network size. These numerical experiments verify the well-recognized claim that decentralized optimization may improve the performance of a networked multi-agent system with respect to network scalability.
Communication cost
Communication cost, in terms of energy consumption and bandwidth, is the major design consideration of a resource-limited networked multi-agent system, and can be approximately evaluated by the volume of information exchange during the decentralized consensus optimization process. Ignoring the extra burden of coordinating the network, for each agent, the communication cost is proportional to the number of iterations multiplied by the volume of information exchange per iteration. Therefore, reducing the information exchange per iteration is of critical importance to the design of lightweight algorithms.
Average volume of information exchange per iteration
TB-ADM | MB-ADM | |
---|---|---|
Broadcast mode | N | N |
Unicast mode | dN | dN |
In summary, the decentralized consensus optimization algorithms, no matter with the broadcast or unicast mode, are scalable to the network size. Since the number of iterations is proportional to the average node degree d, the overall average volume of information exchange is ∼Nd for the broadcast mode and ∼N d^{2} for the unicast mode. As a comparison, consider a centralized networked multi-agent system uniformly randomly deployed in a two-dimensional area with a fusion center which collects measurement vectors from all agents. The average volume of information exchange is $\sim M\sqrt{L}$ while the worst one is ∼ML for agents near the fusion center. When the network size L increases, the communication cost caused by the centralized network infrastructure is unaffordable and the decentralized network infrastructure is hence superior.
Conclusion
This article considers solving the decentralized consensus optimization problem with the parallel version multi-block ADM in a networked multi-agent system. The traditional ADM can be used but it requires the introduction of a second block of auxiliary variables whereas our method takes advantages of the problem’s nature of having multiple blocks of variables. We analyze the rate of convergence of our method applied to the average consensus problem. Analysis results that the two-block ADM is a special case of the multi-block ADM on average consensus. With extensive numerical experiments, we demonstrate the effectiveness of the proposed algorithm.
In the implementation of a networked multi-agent system, practical issues such as packet loss, asynchronization, and quantization are inevitable. This article assumes that the communication links are reliable, the network time is slotted and well synchronized, and the exchanged information is not quantized. We would like to address these issues in future research.
Appendix 1
This section provides some theoretical results in the article.
Development of MB-ADM
The decentralized consensus optimization problem (2) with neighboring consensus constraints can be rewritten as the form of (5). Apparently, g_{ i }=f_{ i }, θ_{ i }=x^{(i)}, and e is an L^{2}N×1 zero vector. Each D_{ i } is an L^{2}N×N matrix with L^{2} blocks of N×N matrices. Each block of D_{ i } can be defined as follows. Consider an L×L matrix U^{(i)}, whose $({i}^{\prime},{j}^{\prime})$th entry ${U}_{{i}^{\prime}{j}^{\prime}}^{\left(i\right)}=1$ if ${j}^{\prime}=i$ and ${i}^{\prime}\in {\mathcal{N}}_{i}$, ${U}_{{i}^{\prime}{j}^{\prime}}^{\left(i\right)}=-1$ if ${i}^{\prime}=i$ and ${j}^{\prime}\in {\mathcal{N}}_{i}$, and ${U}_{{i}^{\prime}{j}^{\prime}}^{\left(i\right)}=0$ otherwise. The $({i}^{\prime}+L{j}^{\prime}-L)$th block of D_{ i }is ${U}_{{i}^{\prime}{j}^{\prime}}^{\left(i\right)}{I}_{N}$, where I_{ N } is an N×N identity matrix. Substituting them to the multi-block ADM, we can find that in optimizing x^{(i)}, agent i only needs its local information as well as part of q; on the other hand, to update its corresponding part of q and λ, each agent only needs based on the information from itself and its neighbors. The resulting algorithm is hence fully decentralized due to the nice structure of {D_{ i }}.
Note that β and μ are positive constant parameters used by the multi-block ADM.
State transition equation of MB-ADM
The initial state is ${s}_{M}\left(1\right)=\left[\frac{{b}_{1}}{1+2\mu \left|{\mathcal{N}}_{1}\right|},\dots ,\frac{{b}_{L}}{1+2\mu \left|{\mathcal{N}}_{L}\right|},\right.$$\left(\right)close="]">0,\dots ,0\phantom{\rule{-8.0pt}{0ex}}$ when each agent i initializes q_{ i }(0)=0, x^{(i)}(0)=0, and λ_{ i }(0)=0.
Proof of Property 1 in Proposition 1
This leads to contradiction. Hence ρ_{M 1}=1 is an eigenvalue of Φ_{ M }with multiplicity 1.
Proof of Proposition 2
Let us consider the two nontrivial special cases.
Case 1
The parameters μ and β are chosen such that μ=2β>0; further, $\frac{2\beta \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{4}$ and $\frac{2\mu \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{2}$ for all j=1,2,…,L.
Recall that $\left|w\right|=\frac{1}{2}$ only for ρ_{M 1}=1. For any other eigenvalues, $\left|w\right|<\frac{1}{2}$, and hence |ρ_{ Mi }|<1 for i≠1.
Case 2
The parameters μ and β are chosen such that μ=β>0; further, $\frac{2\beta \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{2}$ and $\frac{2\mu \left|{\mathcal{N}}_{j}\right|}{1+2\mu \left|{\mathcal{N}}_{j}\right|}<\frac{1}{2}$ for all j=1,2,…,L.
Again, the inequalities turns to equalities only for ρ_{M 1}=1. For any other eigenvalue ρ_{ Mi }, we have |ρ_{ Mi }|<1 which contradicts with |ρ_{ Mi }|≥1. Therefore, |ρ_{ Mi }|<1 for i≠1.
State transition equation of TB-ADM
Declarations
Acknowledgements
The work of Qing Ling is supported in part by NSFC grant 61004137 and Fundamental Research Funds for the Central Universities. The work of Wotao Yin is supported in part by ARL and ARO grant W911NF-09-1-0383 and NSF grants DMS-0748839 and ECCS-1028790. The work of Xiaoming Yuan is supported in part by the General Research Fund No. 203311 from Hong Kong Research Grants Council.
Authors’ Affiliations
References
- Ren W, Beard R, Atkins E: Information consensus in multivehicle cooperative control: collective group behavier through local interaction. IEEE Control Systs. Mag 2007, 27: 71-82.View ArticleGoogle Scholar
- Olfati-Saber R: Kalman-consensus filter: optimality, stability, and performance. In Proceedings of CDC. Shanghai, China; 2009:7036-7042.Google Scholar
- Boyd S, Parikh N, Chu E, Peleato B, Eckstein J: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundation Trends Mach. Learn 2010, 3: 1-122. 10.1561/2200000016View ArticleMATHGoogle Scholar
- Tsitsiklis J: Problems in decentralized decision making and computation. MIT, Ph.D Thesis; 1984.Google Scholar
- Nedic A, Ozdaglar A: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 2009, 54: 48-61.MathSciNetView ArticleMATHGoogle Scholar
- Srivastava K, Nedic A: Distrbited asynchronous constrained stochastic optimization. IEEE J. Sel. Topics Signal Process 2011, 5: 772-790.View ArticleGoogle Scholar
- Rabbat M, Nowak R: Distributed optimization in sensor networks. In Proceedings of IPSN. Berkeley, USA; 2004:20-27.Google Scholar
- Rabbat M, Nowak R: Quantized incremental algorithms for distributed optimization. IEEE J. Sel. Areas Commun 2006, 23: 798-808.View ArticleGoogle Scholar
- Xiao L, Boyd S, Kim S: Distributed average consensus with least-mean-square deviation. J. Parallel Distrib. Comput 2007, 67: 33-46. 10.1016/j.jpdc.2006.08.010View ArticleMATHGoogle Scholar
- Kar S, Moura J: Distributed consensus algorithms in sensor networks: quantized data and random link failures. IEEE Trans. Signal Process 2010, 58: 1383-1400.MathSciNetView ArticleGoogle Scholar
- Olshevsky A: Efficient Information Aggregation Strategies for Distributed Control and Signal Processing. Ph.D Thesis, MIT; 2010.Google Scholar
- Schizas I, Ribeiro A, Giannakis G: Consensus in ad hoc WSNs with noisy links - Part I: distributed estimation of deterministic signals. IEEE Trans. Signal Process 2008, 56: 350-364.MathSciNetView ArticleGoogle Scholar
- Mateos G, Schizas I, Giannakis G: Distributed recursive least-squares for consensus-based in-network adaptive estimation. IEEE Trans. Signal Process 2009, 57: 4583-4588.MathSciNetView ArticleGoogle Scholar
- Ling Q, Tian Z: Decentralized sparse signal recovery for compressive sleeping wireless sensor networks. IEEE Trans. Signal Process 2010, 58: 3816-3827.MathSciNetView ArticleGoogle Scholar
- Bazerque J, Giannakis G: Distributed spectrum sensing for cognitive radio networks by exploiting sparsity. IEEE Trans. Signal Process 2010, 58: 1847-1862.MathSciNetView ArticleGoogle Scholar
- Mateos G, Bazerque J, Giannakis G: Distributed sparse linear regression. IEEE Trans. Signal Process 2010, 58: 5262-5276.MathSciNetView ArticleGoogle Scholar
- Jakovetic D, Xavier J, Moura J: Cooperative convex optimization in networked systems: augmented Lagrangian algorithms with direct gossip communication. IEEE Trans. Signal Process 2011, 59: 3889-3902.MathSciNetView ArticleGoogle Scholar
- Cetin M, Chen L, Fisher I I I J, Ihler A, Moss R, Wainwright M, Willsky A: Distributed fusion in sensor networks. IEEE Signal Process. Mag 2006, 23: 42-55.View ArticleGoogle Scholar
- Predd J, Kulkarni S, Poor V: Distributed learning in wireless sensor networks. IEEE Signal Process. Mag 2007, 24: 56-69.Google Scholar
- Predd J, Kulkarni S, Poor H: A collaborative training algorithm for distributed learning. IEEE Trans. Inf. Theory 2009, 55: 1856-1871.MathSciNetView ArticleGoogle Scholar
- Khan U, Kar S, Moura J: Higher dimensional consensus: learning in large-scale networks. IEEE Trans. Signal Process 2010, 58: 2836-2849.MathSciNetView ArticleGoogle Scholar
- Jadbabaie A, Ozdaglar A, Zargham M: A distributed Newton method for network optimization. In Proceedings of CDC. Shanghai, China; 2009:2736-2741.Google Scholar
- Koshal J, Nedic A, Shanbhag U: Multiuser optimization: distributed algorithms and error analysis. SIAM J. Optimiz 2011, 21: 1046-1081. 10.1137/090770102MathSciNetView ArticleMATHGoogle Scholar
- Wan P, Lemmon M: Distributed network utility maximization using event-triggered augmented Lagrangian methods. In Proceedings of ACC. St. Louis, USA; 2009:3298-3303.Google Scholar
- Zhao F, Shin J, Reich J: Information-driven dynamic sensor collaboration. IEEE Signal Process. Mag 2002, 19: 61-72. 10.1109/79.985685View ArticleGoogle Scholar
- Zhao F, Guibas L: Wireless Sensor Networks: an Information Processing Approach. Morgan Kaufmann, Burlington, USA; 2004.Google Scholar
- Schizas I, Giannakis G, Roumeliotis S, Ribeiro A: Consensus in ad hoc WSNs with noisy links – part II: distributed estimation and smoothing of random signals. IEEE Trans. Signal Process 2008, 56(4):1650-1666.MathSciNetView ArticleGoogle Scholar
- Ribeiro A, Schizas I, Roumeliotis S, Giannakis G: Kalman filtering in wireless sensor networks: reducing communication cost in state estimation problems. IEEE Control Systs. Mag 2010, 30: 66-86.MathSciNetView ArticleGoogle Scholar
- Tao M: Some parallel splitting methods for separable convex programming with O(1/t) convergence rate. in press
- He B, Tao M, Xu M, Yuan X: Alternating directions based contraction method for generally separable linearly constrained convex programming problems. in press
- He B, Tao M, Yuan X: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim 2012, 22: 313-340. 10.1137/110822347MathSciNetView ArticleMATHGoogle Scholar
- Bertsekas D, Tsitsiklis J: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Nashua, USA; 1997.MATHGoogle Scholar
- Bertsekas D: Numerical Optimization. Athena Scientific, Nashua, USA; 1999.Google Scholar
- He B, Yuan X: On the O(1/n) convergence rate of Douglas-Rachford alternating direction method. SIAM J. Num. Anal 2012, 50: 700-709. 10.1137/110836936MathSciNetView ArticleMATHGoogle Scholar
- Erseghe T, Zennaro D, Dall’Anese E, Vangelista L: Fast consensus by the alternating direction multipliers method. IEEE Trans. Signal Process 2011, 59: 5523-5537.MathSciNetView ArticleGoogle Scholar
- Rosenthal J: Convergence rates for Markov chains. SIAM Rev 1995, 37: 387-405. 10.1137/1037083MathSciNetView ArticleMATHGoogle Scholar
- Boyd S, Ghosh A, Prabhakar B, Shah D: Randomized gossip algorithms. IEEE Trans. Inf. Theory 2006, 52: 2508-2530.MathSciNetView ArticleMATHGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.