An efficient implementation of maximum likelihood identification of LTI state-space models by local gradient search

N.H. Bergboer, V. Verdult, M.H.G. Verhaegen

    Research output: Contribution to conferencePaper

    19 Citations (Scopus)
    190 Downloads (Pure)

    Abstract

    We present a numerically efficient implementation of the nonlinear least squares and maximum likelihood identification of multivariable linear time-invariant (LTI) state-space models. This implementation is based on a local parameterization of the system and a gradient search in the resulting parameter space. The output error identification problem is discussed, and its extension to maximum likelihood identification is explained. We show that the maximum likelihood framework yields parameter errors that converge to the Cramer-Rao bound. Furthermore, the implementation is shown to be fast and able to handle large sample size problems.
    Original languageUndefined
    Pages616-621
    Publication statusPublished - 2002
    Event41st IEEE Conference on Decision and Control, CDC 2002 - Las Vegas, United States
    Duration: 10 Dec 200213 Dec 2002
    Conference number: 41

    Conference

    Conference41st IEEE Conference on Decision and Control, CDC 2002
    Abbreviated titleCDC
    CountryUnited States
    CityLas Vegas
    Period10/12/0213/12/02

    Keywords

    • Identification
    • search problems
    • least squares approximations
    • Maximum likelihood estimation
    • Linear systems
    • multivariable systems
    • State-spacemethods
    • IR-55873

    Cite this

    Bergboer, N. H., Verdult, V., & Verhaegen, M. H. G. (2002). An efficient implementation of maximum likelihood identification of LTI state-space models by local gradient search. 616-621. Paper presented at 41st IEEE Conference on Decision and Control, CDC 2002, Las Vegas, United States.