Abstract
Abstract This work discusses about an efficient implementation of the kernel regularization method. In particular, this work focuses on Alternating Direction Method of Multipliers (ADMM) which is one of the convex optimization methods. This work employs two assumptions; (1) the identification input is periodic, and (2) the kernel matrix is tridiagonal. It is shown that ADMM updates can be implemented efficiently under these assumptions. A numerical example is shown to demonstrate the effectiveness of the proposed method.
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.
