Abstract
Piecewise affine (PWA) models serve as an important class of models for nonlinear systems. The identification of PWA models is known to be a difficult task and often implies solving a non-convex combinatorial optimization problems. In this paper, we revisit a recently proposed PWA identification method. We do this to give a novel derivation of the identification method and to show that under certain conditions, the method is optimal in the sense that it finds the PWA function that passes through the measurements and has the least number of hinges. We also show how the alternating direction method of multipliers (ADMM) can be used to solve the underlying convex optimization problem.
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.
