A convex optimization approach to ARMA modeling

Tryphon T. Georgiou, Andres Lindquist

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


We formulate a convex optimization problem for approximating any given spectral density with a rational one having a prescribed number of poles and zeros (n poles and m zeros inside the unit disc and their conjugates). The approximation utilizes the Kullback-Leibler divergence as a distance measure. The stationarity condition for optimality requires that the approximant matches n+1 covariance moments of the given power spectrum and m cepstral moments of the corresponding logarithm, although the latter with possible slack. The solution coincides with one derived by Byrnes, Enqvist, and Lindquist who addressed directly the question of covariance and cepstral matching. Thus, the present paper provides an approximation theoretic justification of such a problem. Since the approximation requires only moments of spectral densities and of their logarithms, it can also be used for system identification.

Original languageEnglish (US)
Pages (from-to)1108-1119
Number of pages12
JournalIEEE Transactions on Automatic Control
Issue number5
StatePublished - Sep 19 2008


  • ARMA modeling
  • Cepstral coefficients
  • Convex optimization
  • Covariance matching

Fingerprint Dive into the research topics of 'A convex optimization approach to ARMA modeling'. Together they form a unique fingerprint.

Cite this