Optimization-based computation of analytic interpolants of bounded complexity
From MaRDI portal
Publication:2504583
DOI10.1016/j.sysconle.2005.01.003zbMath1129.93381MaRDI QIDQ2504583
Ryozo Nagamune, Anders Blomqvist
Publication date: 25 September 2006
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2005.01.003
optimization; Carathéodory function; bounded complexity; Kullback--Leibler divergence; Nevanlinna--Pick interpolation
93B51: Design techniques (robust design, computer-aided design, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The commutant lifting approach to interpolation problems
- Geometry of the Kimura-Georgiou parametrization of modelling filters
- Kullback-leibler approximation of spectral density functions
- A Topological Approach to Nevanlinna–Pick Interpolation
- Realization of power spectra from partial covariance sequences
- A Convex Optimization Approach to the Rational Covariance Extension Problem
- The interpolation problem with a degree constraint
- On the Duality between Filtering and Nevanlinna--Pick Interpolation
- Spectral estimation via selective harmonic amplification
- A generalized entropy criterion for Nevanlinna-Pick interpolation with degree constraint
- On The Relation Between Weighted Frequency-Domain Maximum-Likelihood Power Spectral Estimation and the Prefiltered Covariance Extension Approach
- A complete parameterization of all positive rational extensions of a covariance sequence
- Matrix-valued nevanlinna-pick interpolation with complexity constraint: an optimization approach
- A robust solver using a continuation method for Nevanlinna-Pick interpolation with degree constraint
- A Shaping Limitation of Rational Sensitivity Functions With a Degree Constraint
- Generalized interpolation in 𝐻^{∞} with a complexity constraint
