On the Convergence of an Efficient Algorithm for Kullback–Leibler Approximation of Spectral Densities

From MaRDI portal
Publication:5347633

DOI10.1109/TAC.2010.2057171zbMATH Open1368.93678arXiv0911.0434OpenAlexW2143135249MaRDI QIDQ5347633FDOQ5347633


Authors: Augusto Ferrante, Francesco Ticozzi, Federico Ramponi Edit this on Wikidata


Publication date: 25 August 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler pseudo-distance, which gives rise to a convex optimization problem. After developing the variational analysis, we discuss the properties of an efficient algorithm for the solution of the corresponding dual problem, based on the iteration of a nonlinear map in a bounded subset of the dual space. Our main result is the proof of local convergence of the latter, established as a consequence of the Central Manifold Theorem. Supported by numerical evidence, we conjecture that, in the mentioned bounded set, the convergence is actually global.


Full work available at URL: https://arxiv.org/abs/0911.0434







Cited In (10)





This page was built for publication: On the Convergence of an Efficient Algorithm for Kullback–Leibler Approximation of Spectral Densities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347633)