scispace - formally typeset
Open AccessJournal ArticleDOI

Further Results on the Convergence of the Pavon–Ferrante Algorithm for Spectral Estimation

Giacomo Baggio
- 23 Jan 2018 - 
- Vol. 63, Iss: 10, pp 3510-3515
TLDR
In this paper, the authors provide a detailed analysis of the global convergence properties of an extensively studied and extremely effective fixed-point algorithm for the Kullback-Leibler approximation of spectral densities, proposed by Pavon and Ferrante in their paper.
Abstract
In this paper, we provide a detailed analysis of the global convergence properties of an extensively studied and extremely effective fixed-point algorithm for the Kullback–Leibler approximation of spectral densities, proposed by Pavon and Ferrante in their paper “On the Georgiou–Lindquist approach to constrained Kullback–Leibler approximation of spectral densities.” Our main result states that the algorithm globally converges to one of its fixed points.

read more

Citations
More filters
Book ChapterDOI

Real and Complex Analysis

Roger Cooke
Journal ArticleDOI

On the Existence of a Solution to a Spectral Estimation Problem à la Byrnes–Georgiou–Lindquist

TL;DR: In this article, it was shown that a solution indeed exists given an arbitrary matrix-valued prior density, and the main tool in their proof is the topological degree theory, which is used in our proof.
Journal ArticleDOI

On the Well-Posedness of a Parametric Spectral Estimation Problem and Its Numerical Solution

TL;DR: In this article, a spectral estimation problem is formulated in a parametric fashion, and the solution parameter depends continuously on the prior function, and a smooth parametrization of admissible spectral densities is obtained.
Journal ArticleDOI

Learning Latent Variable Dynamic Graphical Models by Confidence Sets Selection

TL;DR: A new method is proposed, which accounts for the uncertainty in the estimation by computing a “confidence neighborhood” containing the true model with a prescribed probability, which allows for the presence of a small number of latent variables in order to enforce sparsity of the identified graph.
Journal ArticleDOI

On the Uniqueness Result of Theorem 6 in “Relative Entropy and the Multivariable Multidimensional Moment Problem”

TL;DR: In this paper, a moment map defined over a parametric family of spectral densities is shown to have a critical point, namely a point at which the Jacobian loses rank.
References
More filters
Book

Real and complex analysis

Walter Rudin
TL;DR: In this paper, the Riesz representation theorem is used to describe the regularity properties of Borel measures and their relation to the Radon-Nikodym theorem of continuous functions.
Book

The stability and control of discrete processes

TL;DR: In this article, Liapunov's characterization of stable matrices is presented, and an algorithm for computing An is presented for linear systems x' = Ax + f(n).
Journal ArticleDOI

Kullback-Leibler approximation of spectral density functions

TL;DR: It is shown that there is a unique spectral density /spl Phi/ which minimizes this Kullback-Leibler distance, and that this optimal approximate is of the form /spl Psi//Q where the "correction term" Q is a rational spectral density function and the coefficients of Q can be obtained numerically by solving a suitable convex optimization problem.
Journal ArticleDOI

A generalized entropy criterion for Nevanlinna-Pick interpolation with degree constraint

TL;DR: A generalized entropy criterion for solving the rational Nevanlinna-Pick problem for n+1 interpolating conditions and the degree of interpolants bounded by n is presented, which requires a selection of a monic Schur polynomial of degree n.
Related Papers (5)