Abstract
In this paper, we investigate the identification of the class of block-oriented nonlinear systems presented by Li et al. [2011] by using an iterative method. Firstly a common model is proposed to represent such block-oriented systems. Then identifying the common model is formulated as a biconvex optimization problem. Based on this, a normalized alterative convex search (NACS) algorithm is proposed under a given arbitrary nonzero initial condition. It is shown that we only need to find the unique partial optimum point of a biconvex cost function in the formulated optimization problem in order to obtain its global minimum point. Thus, the convergence property of the proposed algorithm is established under arbitrary nonzero initial conditions. The approach presented in this paper provides a unified framework for the identification of block-oriented systems.
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.
