Distributed Reconstruction of Nonlinear Networks: An ADMM Approach
Abstract
In this paper, we present a distributed algorithm for the reconstruction of large-scale nonlinear networks. In particular, we focus on the identification from time-series data of the nonlinear functional forms and associated parameters of large-scale nonlinear networks. Recently, a nonlinear network reconstruction problem was formulated as a nonconvex optimisation problem based on the combination of a marginal likelihood maximisation procedure with sparsity inducing priors. Using a convex-concave procedure (CCCP), an iterative reweighted lasso algorithm was derived to solve the initial nonconvex optimisation problem. By exploiting the structure of the objective function of this reweighted lasso algorithm, a distributed algorithm can be designed. To this end, we apply the alternating direction method of multipliers (ADMM) to decompose the original problem into several subproblems. To illustrate the effectiveness of the proposed methods, we use our approach to identify a network of interconnected Kuramoto oscillators with different network sizes (500~100,000 nodes).
Keywords
Cite
@article{arxiv.1403.7429,
title = {Distributed Reconstruction of Nonlinear Networks: An ADMM Approach},
author = {Wei Pan and Aivar Sootla and Guy-Bart Stan},
journal= {arXiv preprint arXiv:1403.7429},
year = {2014}
}
Comments
To appear in the Preprints of 19th IFAC World Congress 2014