Distributed Weighted Least Squares Estimator Based on ADMM
Wireless sensor network has recently received much attention due to its broad applicability and ease-of-installation. This paper is concerned with a distributed state estimation problem, where all sensor nodes are required to achieve a consensus estimation. The weighted least squares (WLS) estimator is an appealing way to handle this problem since it does not need any prior distribution information. To this end, we first exploit the equivalent relation between the information filter and WLS estimator. Then, we establish an optimization problem under the relation coupled with a consensus constraint. Finally, the consensus-based distributed WLS problem is tackled by the alternating direction method of multiplier (ADMM). Numerical simulation together with theoretical analysis testify the convergence and consensus estimations between nodes.
Code (1)
Tasks
RelationState EstimationSimilar Papers 제목 키워드 기반
A Weighted Least-Squares Method for Non-Asymptotic Identification of Markov Parameters from Multiple Trajectories
Markov parameters play a key role in system identification. There exists many algorithms where these parameters are estimated using least-squares in a first, pre-processing, step, including subspace identification and mu…
Least Squares Approximation for a Distributed System
In this work, we develop a distributed least squares approximation (DLSA) method that is able to solve a large family of regression problems (e.g., linear regression, logistic regression, and Cox's model) on a distribute…
Computational EfficiencyregressionDistributed Least Squares in Small Space via Sketching and Bias Reduction
Matrix sketching is a powerful tool for reducing the size of large data matrices. Yet there are fundamental limitations to this size reduction when we want to recover an accurate estimator for a task such as least square…
Efficient algorithms for multivariate shape-constrained convex regression problems
Shape-constrained convex regression problem deals with fitting a convex function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This …
regressionUnwrapping ADMM: Efficient Distributed Computing via Transpose Reduction
Recent approaches to distributed model fitting rely heavily on consensus ADMM, where each node solves small sub-problems using only local data. We propose iterative methods that solve {\em global} sub-problems over an en…
Distributed Computing