Hellinger vs. Kullback-Leibler multivariable spectrum approximation
Optimization and Control
2007-05-23 v1
Abstract
In this paper, we study a matricial version of the Byrnes-Georgiou-Lindquist generalized moment problem with complexity constraint. We introduce a new metric on multivariable spectral densities induced by the family of their spectral factors which, in the scalar case, reduces to the Hellinger distance. We solve the corresponding constrained optimization problem via duality theory. A highly nontrivial existence theorem for the dual problem is established in the Byrnes-Lindquist spirit. A matricial Newton-type algorithm is finally provided for the numerical solution of the dual problem. Simulation indicates that the algorithm performs effectively and reliably.
Cite
@article{arxiv.math/0702212,
title = {Hellinger vs. Kullback-Leibler multivariable spectrum approximation},
author = {A. Ferrante and M. Pavon and F. Ramponi},
journal= {arXiv preprint arXiv:math/0702212},
year = {2007}
}
Comments
32 pages, 1 figure