Abstract
This paper proposes a hyper-parameter estimation algorithm for the regularized least squares problem in the empirical Bayesian approach arising from FIR model identification using OBFs (orthonormal basis functions)-based kernels. The algorithm consists of two steps by dividing the decision variables into two groups and alternately minimizing with respect to each group. It is shown that DC (difference of convex functions) programming is effectively applicable in the algorithm because the search space is shown to be bounded. The paper includes a couple of numerical simulations to show the efficiency of the method.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
