On the Convergence of an Efficient Algorithm for Kullback–Leibler Approximation of Spectral Densities
DOI10.1109/TAC.2010.2057171zbMATH Open1368.93678arXiv0911.0434OpenAlexW2143135249MaRDI QIDQ5347633FDOQ5347633
Authors: Augusto Ferrante, Francesco Ticozzi, Federico Ramponi
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.0434
Convex programming (90C25) Inference from stochastic processes and spectral analysis (62M15) Estimation and detection in stochastic control theory (93E10)
Cited In (10)
- Lower bounds of success probabilities for high-fidelity approach in KLM scheme
- Information matrix and D-optimal design with Gaussian inputs for Wiener model identification
- A micro-macro acceleration method for the Monte Carlo simulation of stochastic differential equations
- On the well-posedness of multivariate spectrum approximation and convergence of high-resolution spectral estimators
- Variance error, interpolation and experiment design
- An interpretation of the dual problem of the THREE-like approaches
- Analysis of a micro-macro acceleration method with minimum relative entropy moment matching
- Optimal Kullback-Leibler Aggregation via Spectral Theory of Markov Chains
- Rational approximations of spectral densities based on the Alpha divergence
- Analyzing the impact of regularization on REMSE
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)