Abstract

This paper considers the regularization parameter determination of l 1 -regularized minimization problem. We solve the l 1 -regularized problem using iterative reweighted least squares (IRLS) which involves solving a linear system whose coefficient matrix has the form α M + ( 1 − α ) N ( α ∈ ( 0 , 1 ) ). The aim of this paper is to find an efficient and computationally inexpensive algorithm to both choose the regularization parameter and solve the l 1 -regularized problem. In order to achieve this, we propose an IRLS algorithm with adaptive regularization parameter selection based on a heuristic parameter determination rule—de Boor’s parameter selection criterion. Compared with some of the state-of-the-art algorithms and parameter selection rules, the numerical experiments show the efficiency and robustness of the proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.