Matching pursuit with unbounded parameter domains

DOI10.1007/s10444-023-10097-1OpenAlexW4390012925MaRDI QIDQ6184992

Yan-Bo Wang, Xiaoyun Sun, Wei Qu

Publication date: 29 January 2024

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-023-10097-1

zbMATH Keywords

Hardy spacereproducing kernel Hilbert spaceenergy matching pursuit

Mathematics Subject Classification ID

Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Hardy spaces (30H10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytic unit quadrature signals with nonlinear phase
• Lipschitzian optimization without the Lipschitz constant
• Recent developments and trends in global optimization
• Adaptative decomposition: the case of the Drury-Arveson space
• A taxonomy of global optimization methods based on response surfaces
• Some remarks on greedy algorithms
• Some remarks on the boundary behaviors of functions in the monogenic Hardy spaces
• Reproducing kernel sparse representations in relation to operator equations
• Best kernel approximation in Bergman spaces
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Nonlinear phase unwinding of functions
• Phase unwinding, or invariant subspace decompositions of Hardy spaces
• Adaptive Fourier series---a variation of greedy algorithm
• Analytic signals and harmonic measures
• Adaptive orthonormal systems for matrix-valued functions
• Greedy Approximation
• A Theory on Non-Constant Frequency Decompositions and Applications
• Intrinsic mono-component decomposition of functions: An advance of Fourier theory
• Matching pursuits with time-frequency dictionaries
• Sparse representation of approximation to identity
• Mono‐components for decomposition of signals
• Two‐dimensional adaptive Fourier decomposition
• Adaptive greedy approximations
• \(n\)-best kernel approximation in reproducing kernel Hilbert spaces
• Granular sieving algorithm for selecting best n$$ n $$ parameters
• Sparse representations of random signals
• Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes

This page was built for publication: Matching pursuit with unbounded parameter domains