Pages that link to "Item:Q515909"
From MaRDI portal
The following pages link to Orthogonal matching pursuit under the restricted isometry property (Q515909):
Displaying 14 items.
- Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
- Sparsity and incoherence in orthogonal matching pursuit (Q1710949) (← links)
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs (Q2036421) (← links)
- Efficiency of orthogonal super greedy algorithm under the restricted isometry property (Q2067856) (← links)
- Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension (Q2359687) (← links)
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q2632508) (← links)
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy (Q2699021) (← links)
- Flavors of Compressive Sensing (Q4609797) (← links)
- The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials (Q5094726) (← links)
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776) (← links)
- Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares (Q5881245) (← links)
- Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method (Q5881246) (← links)
