Analysis of a nonsmooth optimization approach to robust estimation
From MaRDI portal
Abstract: In this paper, we consider the problem of identifying a linear map from measurements which are subject to intermittent and arbitarily large errors. This is a fundamental problem in many estimation-related applications such as fault detection, state estimation in lossy networks, hybrid system identification, robust estimation, etc. The problem is hard because it exhibits some intrinsic combinatorial features. Therefore, obtaining an effective solution necessitates relaxations that are both solvable at a reasonable cost and effective in the sense that they can return the true parameter vector. The current paper discusses a nonsmooth convex optimization approach and provides a new analysis of its behavior. In particular, it is shown that under appropriate conditions on the data, an exact estimate can be recovered from data corrupted by a large (even infinite) number of gross errors.
Recommendations
- Robust maximum likelihood estimation in the linear model
- Global non-smooth optimization in robust multivariate regression
- scientific article; zbMATH DE number 884961
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
- scientific article; zbMATH DE number 1748553
Cites work
- scientific article; zbMATH DE number 1941665 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Finite Algorithm for the Minimum $l_\infty $ Solution to a System of Consistent Linear Equations
- A General Qualitative Definition of Robustness
- A Sparsification Approach to Set Membership Identification of Switched Affine Systems
- A sparse optimization approach to state observer design for switched linear systems
- Analysis of Sparse Regularization Based Robust Regression Approaches
- Compressed sensing
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Highly Robust Error Correction byConvex Programming
- Identification of hybrid systems. A tutorial
- Identification of switched linear regression models using sum-of-norms regularization
- Identification of switched linear systems via sparse optimization
- Interior point methods 25 years later
- Introductory lectures on convex optimization. A basic course.
- Least Median of Squares Regression
- On covariance function tests used in system identification
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Robust Statistics
- Robust Statistics
- Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
- Segmentation of ARX-models using sum-of-norms regularization
- Selective <inline-formula> <tex-math notation="TeX">$\ell_{1}$</tex-math></inline-formula> Minimization for Sparse Recovery
- System identification in the presence of outliers and random noises: a compressed sensing approach
- The Lasso problem and uniqueness
- The place of the \(L_ 1\)-norm in robust estimation
Cited in
(10)- Minimizing robust estimates of sums of parameterized functions
- Online continuous time system identification in the presence of impulsive terms
- A stochastic analysis of robust estimation algorithms inH∞with rational basis functions
- ROBUSTNESS ANALYSIS OF THE DATA-SELECTIVE VOLTERRA NLMS ALGORITHM
- Robustness analysis of a maximum correntropy framework for linear regression
- On sparsity‐inducing methods in system identification and state estimation
- Relaxed maximum a posteriori fault identification
- Adaptive identification of linear systems subject to Gross errors
- Global optimization for low-dimensional switching linear regression and bounded-error estimation
- \(\sqrt n\)-consistent robust integration-based estimation
This page was built for publication: Analysis of a nonsmooth optimization approach to robust estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q254560)
