On sparsity‐inducing methods in system identification and state estimation
From MaRDI portal
Publication:6177342
DOI10.1002/rnc.5995zbMath1530.93066OpenAlexW4206999828MaRDI QIDQ6177342
Publication date: 17 January 2024
Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rnc.5995
System identification (93B30) Linear systems in control theory (93C05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of a nonsmooth optimization approach to robust estimation
- A mathematical introduction to compressive sensing
- Identification of switched linear systems via sparse optimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Segmentation of ARX-models using sum-of-norms regularization
- The place of the \(L_ 1\)-norm in robust estimation
- Time-optimal hands-off control for linear time-invariant systems
- Model recovery for Hammerstein systems using the hierarchical orthogonal matching pursuit method
- A sparse optimization approach to state observer design for switched linear systems
- The Lasso problem and uniqueness
- An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation
- Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model
- Nuclear norm system identification with missing inputs and outputs
- Identification of switched linear regression models using sum-of-norms regularization
- Event-Triggered State Observers for Sparse Sensor Noise/Attacks
- Maximum Hands-Off Control: A Paradigm of Control Effort Minimization
- Selective <inline-formula> <tex-math notation="TeX">$\ell_{1}$</tex-math></inline-formula> Minimization for Sparse Recovery
- Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
- Identifiability of discrete-time linear switched systems
- Greed is Good: Algorithmic Results for Sparse Approximation
- Highly Robust Error Correction byConvex Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Iteratively reweighted least squares minimization for sparse recovery
- On a Class of Optimization-Based Robust Estimators
- An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints
- Analysis of Sparse Regularization Based Robust Regression Approaches
- Matching Pursuit LASSO Part I: Sparse Recovery Over Big Dictionary
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Analysis of the Least Sum-of-Minimums Estimator for Switched Systems
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Convex Optimization Based State Estimation Against Sparse Integrity Attacks
- A Sparsification Approach to Set Membership Identification of Switched Affine Systems
- Secure State Estimation Against Sensor Attacks in the Presence of Noise
- Minimality and identifiability of discrete‐time switched autoregressive exogenous systems
- An Optimization Framework for Resilient Batch Estimation in Cyber-Physical Systems
