Group sparse RLS algorithms
From MaRDI portal
Publication:2800923
DOI10.1002/ACS.2449zbMATH Open1334.93188OpenAlexW1551912413MaRDI QIDQ2800923FDOQ2800923
Authors: Ender M. Eksioglu 
Publication date: 19 April 2016
Published in: International Journal of Adaptive Control and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/acs.2449
Recommendations
- A novel generalized group-sparse mixture adaptive filtering algorithm
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- The benefit of group sparsity
- Adaptive regularization using the entire solution surface
Filtering in stochastic control theory (93E11) System identification (93B30) Adaptive control/observation systems (93C40) Least squares and related methods for stochastic control systems (93E24)
Cited In (6)
- The benefit of group sparsity
- Distributed sparse identification for stochastic dynamic systems under cooperative non-persistent excitation condition
- Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification
- Group sparse optimization for learning predictive state representations
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Online sparse identification for regression models
This page was built for publication: Group sparse RLS algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800923)
