Hellinger vs. Kullback-Leibler multivariable spectrum approximation
A. Ferrante, M. Pavon, F. Ramponi
Abstract
In this paper, we study a matricial version of the Byrnes-Georgiou-Lindquist generalized moment problem with complexity constraint. We introduce a new metric on multivariable spectral densities induced by the family of their spectral factors which, in the scalar case, reduces to the Hellinger distance. We solve the corresponding constrained optimization problem via duality theory. A highly nontrivial existence theorem for the dual problem is established in the Byrnes-Lindquist spirit. A matricial Newton-type algorithm is finally provided for the numerical solution of the dual problem. Simulation indicates that the algorithm performs effectively and reliably.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka et al.