Affinely parametrized state-space models: Ways to maximize the Likelihood Function

Adrian Wills, Chengpu Yu, Lennart Ljung, Michel Verhaegen

Research output: Contribution to journalConference articleScientificpeer-review

2 Citations (Scopus)
21 Downloads (Pure)

Abstract

Using Maximum Likelihood (or Prediction Error) methods to identify linear state space model is a prime technique. The likelihood function is a nonconvex function and care must be exercised in the numerical maximization. Here the focus will be on affine parameterizations which allow some special techniques and algorithms. Three approaches to formulate and perform the maximization are described in this contribution: (1) The standard and well known Gauss-Newton iterative search, (2) a scheme based on the EM (expectation-maximization) technique, which becomes especially simple in the affine parameterization case, and (3) a new approach based on lifting the problem to a higher dimension in the parameter space and introducing rank constraints.

Original languageEnglish
Pages (from-to)718-723
JournalIFAC-PapersOnLine
Volume51
Issue number15
DOIs
Publication statusPublished - 2018
EventSYSID 2018: 18th IFAC Symposium on System Identification - Stockholm, Sweden
Duration: 9 Jul 201811 Jul 2018

Keywords

  • difference-of-convex optimization
  • expectation-maximization algorithm
  • maximum-likelihood estimation
  • Parameterized state-space model

Fingerprint Dive into the research topics of 'Affinely parametrized state-space models: Ways to maximize the Likelihood Function'. Together they form a unique fingerprint.

  • Cite this