Abstract

Abstract This paper presents a regularized nonlinear least-squares identification approach for linear parameter-varying (LPV) systems. The objective of the method is, on the one hand, to obtain an LPV model of which the response fits the system measurements as accurately as possible and, on the other hand, to favor models with an as simple as possible dependency on the scheduling parameter. This is accomplished by introducing l 2 , 1 -norm regularization into the nonlinear least-squares problem. The resulting nonsmooth optimization problem is reformulated into a nonlinear second-order cone program and solved using a sequential convex programming approach. Through an iterative reweighting of the regularization, the parameters that do not substantially contribute to the system response are penalized heavily, while the significant parameters remain unaffected or are penalized only slightly. Numerical and experimental validations of the proposed method show a substantial model simplification in comparison with the nonregularized solution, without significantly sacrificing model accuracy.

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.