Fast, Globally Converging Algorithms for Spectral Moments Problems
(English)Manuscript (preprint) (Other academic)
In this paper, we consider the matricial version of generalized moment problem with degree constraint. Specifically we focus on computing the solution that minimize the Kullback-Leibler criterion. Several strategies to find such optimum via descent methods are considered and their convergence studied. In particular a parameterization with better numerical properties is derived from a spectral factorization problem. Such parameterization, in addition to guaranteeing descent methods to be globally convergent, it appears to be very reliable in practice.
IdentifiersURN: urn:nbn:se:kth:diva-39040OAI: oai:DiVA.org:kth-39040DiVA: diva2:439280
QC 201109072011-09-082011-09-072011-09-08Bibliographically approved