Computer Science – Information Theory
Scientific paper
2011-12-29
Computer Science
Information Theory
arXiv admin note: substantial text overlap with arXiv:1105.0442
Scientific paper
In this paper, we consider the problem of sparse recovery from nonlinear measurements, which has applications in state estimation and bad data detection for power networks. An iterative mixed $\ell_1$ and $\ell_2$ convex programming is used to estimate the true state by locally linearizing the nonlinear measurements. When the measurements are linear, through using the almost Euclidean property for a linear subspace, we derive a new performance bound for the state estimation error under sparse bad data and additive observation noise. When the measurements are nonlinear, we give conditions under which the solution of the iterative algorithm converges to the true state even though the locally linearized measurements may not be the actual nonlinear measurements. We also numerically evaluate an iterative convex programming approach to perform bad data detections in nonlinear electrical power networks problems. As a byproduct, in this paper we provide sharp bounds on the almost Euclidean property of a linear subspace, using the "escape-through-a-mesh" theorem from geometric functional analysis.
Tang Ao
Wang Meng
Xu Weiyu
No associations
LandOfFree
Sparse Recovery from Nonlinear Measurements with Applications in Bad Data Detection for Power Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sparse Recovery from Nonlinear Measurements with Applications in Bad Data Detection for Power Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse Recovery from Nonlinear Measurements with Applications in Bad Data Detection for Power Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-728335