From Finite Covariance Windows to Modeling Filters: A Convex Optimization Approach

  • Authors:
  • Christopher I. Byrnes;Sergei V. Gusev;Anders Lindquist

  • Affiliations:
  • -;-;-

  • Venue:
  • SIAM Review
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The trigonometric moment problem is a classical moment problem with numerous applications in mathematics, physics, and engineering. The rational covariance extension problem is a constrained version of this problem, with the constraints arising from the physical realizability of the corresponding solutions. Although the maximum entropy method gives one well-known solution, in several applications a wider class of solutions is desired. In a seminal paper, Georgiou derived an existence result for a broad class of models. In this paper, we review the history of this problem, going back to Carath{éodory, as well as applications to stochastic systems and signal processing. In particular, we present a convex optimization problem for solving the rational covariance extension problem with degree constraint. Given a partial covariance sequence and the desired zeros of the shaping filter, the poles are uniquely determined from the unique minimum of the corresponding optimization problem. In this way we obtain an algorithm for solving the covariance extension problem, as well as a constructive proof of Georgiou's existence result and his conjecture, a generalized version of which we have recently resolved using geometric methods. We also survey recent related results on constrained Nevanlinna--Pick interpolation in the context of a variational formulation of the general moment problem.