Fixed-point algorithms for frequency estimation and structured low rank approximation
From MaRDI portal
Publication:1990967
Abstract: We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic formulation of the fixed-point algorithm we show that it converges to the minimum of the convex envelope of the original objective function along with its structured matrix constraint. It often happens that this solution agrees with the solution to the original minimization problem, and we provide a simple criterium for when this is true. We also provide more general fixed-point algorithms that can be used to treat the problems of making weighted approximations by sums of exponentials given equally or unequally spaced sampling. We apply the method to the case of missing data, although optimal convergence of the fixed-point algorithm is not guaranteed in this case. However, it turns out that the method often gives perfect reconstruction (up to machine precision) in such cases. We also discuss multidimensional extensions, and illustrate how the proposed algorithms can be used to recover sums of exponentials in several variables, but when samples are available only along a curve.
Recommendations
Cites work
- A New Frequency Estimation Method for Equally and Unequally Spaced Data
- ANALYTIC PROPERTIES OF SCHMIDT PAIRS FOR A HANKEL OPERATOR AND THE GENERALIZED SCHUR-TAKAGI PROBLEM
- Compressed Sensing Off the Grid
- Computation of generalized matrix functions
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Derivatives of Spectral Functions
- Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hankel matrix rank minimization with applications to system identification and realization
- Infinite Hankel matrices and generalized Caratheodory-Fejer and I. Schur problems
- Infinite Hankel matrices and generalized Caratheodory-Fejer and Riesz problems
- Introduction to spectral analysis
- Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
- Nonlinear approximation of functions in two dimensions by sums of exponential functions
- Nonlinear approximation of functions in two dimensions by sums of wave packets
- On approximation of functions by exponential sums
- On general domain truncated correlation and convolution operators with finite rank
- On generalized matrix functions
- Operator-Lipschitz estimates for the singular value functional calculus
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Sparse approximation of functions using sums of exponentials and AAK theory
- The Asymptotic Behavior of Firmly Nonexpansive Mappings
- Toeplitz and Hankel operators on the Paley-Wiener space
- Variational Analysis
Cited in
(7)- Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm
- Multichannel frequency estimation with constant amplitude via convex structured low-rank approximation
- SQNR estimation of fixed-point DSP algorithms
- On convex envelopes and regularization of non-convex functionals without moving global minima
- Structured Frequency Algorithms
- Frequency-limited balanced truncation with low-rank approximations
- Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method
This page was built for publication: Fixed-point algorithms for frequency estimation and structured low rank approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990967)
