Pages that link to "Item:Q901110"

The following pages link to On the complexity of piecewise affine system identification (Q901110):

Displaying 9 items.

• On the complexity of switching linear regression (Q340631) (← links)
• Global optimization for low-dimensional switching linear regression and bounded-error estimation (Q1640233) (← links)
• Persistence of excitation for identifying switched linear systems (Q2071985) (← links)
• Data-driven switching modeling for MPC using regression trees and random forests (Q2178240) (← links)
• Rao-blackwellized sampling for batch and recursive Bayesian inference of piecewise affine models (Q2184548) (← links)
• Valid inequalities for concave piecewise linear regression (Q2294266) (← links)
• Piecewise affine regression via recursive multiple least squares and multicategory discrimination (Q2409294) (← links)
• Identification of hybrid and linear parameter‐varying models via piecewise affine regression using mixed integer programming (Q6054829) (← links)
• Direct data‐driven design of switching controllers (Q6054839) (← links)