A Convex Optimization Approach to the Rational Covariance Extension Problem (Q4237219)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1272835
Language Label Description Also known as
default for all languages
No label defined
    English
    A Convex Optimization Approach to the Rational Covariance Extension Problem
    scientific article; zbMATH DE number 1272835

      Statements

      A Convex Optimization Approach to the Rational Covariance Extension Problem (English)
      0 references
      0 references
      0 references
      0 references
      31 March 1999
      0 references
      rational covariance extension
      0 references
      partial stochastic realization
      0 references
      trigonometric moment problem
      0 references
      spectral estimation
      0 references
      speech processing
      0 references
      stochastic modeling
      0 references
      Carathéodory-Féjer problem
      0 references
      Carathéodory-Féjer problem found many recent applications to time series analysis, control theory and in general optimization theory. For many of these aspects and the theory developed from the original ideas of Carathéodory, Féjer, Schur, Nevanlinna, Pick, see \textit{C. Foias} and \textit{A. E. Frazho}, ``The commutant lifting approach to interpolation problems'' (1990; Zbl 0718.47010). Of particular interest to the interpolation question of Carathéodory-Féjer are its rational solutions with additional constraints (such as the location of zeroes and poles, minimal degree, etc.). A conjecture of \textit{A. Georgiou}, ``Partial realization of covariance sequences'', Ph.D. thesis, Univ. of Florida, Gainesville (1983) asked exactly for such a class of rational functions which solve the Carathéodory-Féjer problem. The first solution to the Georgiou problem was obtained in \textit{C. I. Byrnes}, \textit{A. Lindquist}, \textit{S. V. Gusev} and \textit{A. S. Mateev}, IEEE Trans. Autom. Control 40, No. 11, 1841-1857 (1995; Zbl 0847.93008). The present paper solves the same problem via a natural optimization process. The resulting algorithm combined convex and dual optimization techniques with typical function theoretic methods. As a result a much more constructive solution to the Carathéodory-Féjer problem with the constraints imposed by the Georgiou conjecture is obtained.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references