Convex Reformulation of Information Constrained Linear State Estimation with Mixed-Binary Variables for Outlier Accommodation
This article considers the challenge of accommodating outlier measurements in state estimation. The Risk-Averse Performance-Specified (RAPS) state estimation approach addresses outliers as a measurement selection Bayesian risk minimization problem subject to an information accuracy constraint, which is a non-convex optimization problem. Prior explorations into RAPS rely on exhaustive search, which becomes computationally infeasible as the number of measurements increases. This paper derives a convex formulation for the RAPS optimization problems via transforming the mixed-binary variables into linear constraints. The convex reformulation herein can be solved by convex programming toolboxes, significantly enhancing computational efficiency. We explore two specifications: Full-RAPS, utilizing the full information matrix, and Diag-RAPS, focusing on diagonal elements only. The simulation comparison demonstrates that Diag-RAPS is faster and more efficient than Full-RAPS. In comparison with Kalman Filter (KF) and Threshold Decisions (TD), Diag-RAPS consistently achieves the lowest risk, while achieving the performance specification when it is feasible.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyState EstimationSimilar Papers 제목 키워드 기반
Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
We show that the training problem of a deep linear neural network under the squared loss admits an exact convex reformulation in a lifted space over a generalized completely positive cone. The reformulation has the same …
Fast Algorithm for Constrained Linear Inverse Problems
We consider the constrained Linear Inverse Problem (LIP), where a certain atomic norm (like the $\ell_1 $ norm) is minimized subject to a quadratic constraint. Typically, such cost functions are non-differentiable which …
compressed sensingDenoisingImage DenoisingNovel min-max reformulations of Linear Inverse Problems
In this article, we dwell into the class of so-called ill-posed Linear Inverse Problems (LIP) which simply refers to the task of recovering the entire signal from its relatively few random linear measurements. Such probl…
Dictionary LearningRecommendation SystemsConvex reformulations for a special class of nonlinear MPC problems
We show how the solution to NMPC problems for a special type of input-affine discrete-time systems can be obtained by reformulating the underlying non-convex optimal control problem in terms of a finite number of convex …
First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been establis…