Recursive regularisation parameter selection for sparse RLS algorithm

Recursive regularisation parameter selection for sparse RLS algorithm

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this Letter, the authors propose a recursive regularisation parameter selection method for sparse recursive least squares (RLS) algorithm. The proposed RLS algorithm is regularised by a convex function, which equals the linear combination of two convex functions, one to cope with random sparsity, and the other to cope with group sparsity. The normal equations corresponding to the RLS algorithm with the proposed convex regularised penalty function are derived, and a recursive algorithm to update the regularisation parameters (i.e. the coefficients of the linear combination) is proposed. As an example, by using the linear combination of an -norm and an -norm as the penalty function, simulation results show that the proposed sparse RLS with recursive regularisation parameter selection can achieve better performance in terms of mean square error for a slowly time-varying sparse system with both random sparsity and group sparsity.


    1. 1)
      • 1. Haykin, S.: ‘Adaptive filter theory’ (Prentice Hall, Upper Saddle River, NJ, USA, 2002, 4th edn.).
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • 6. Eksioglu, E.M.: ‘Sparsity regularised recursive least squares adaptive filtering’, Signal Process.., 2011, 5, (5), pp. 480487.
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
      • 13. Bertsekas, D., Nedic, A., Ozdaglar, A.: ‘Convex analysis and optimization’ (Athena Scientific, Cambridge, Massachusetts, 2003).

Related content

This is a required field
Please enter a valid email address