Pages that link to "Item:Q5272397"
From MaRDI portal
The following pages link to Sparse Recovery With Orthogonal Matching Pursuit Under RIP (Q5272397):
Displayed 50 items.
- Orthogonal one step greedy procedure for heteroscedastic linear models (Q254223) (← links)
- Nearly optimal minimax estimator for high-dimensional sparse linear regression (Q385791) (← links)
- Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R (Q506436) (← links)
- Orthogonal matching pursuit under the restricted isometry property (Q515909) (← links)
- Dictionary descent in optimization (Q519963) (← links)
- Hard thresholding pursuit algorithms: number of iterations (Q739467) (← links)
- Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Sampling in the analysis transform domain (Q900778) (← links)
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression (Q1677029) (← links)
- Sparsity and incoherence in orthogonal matching pursuit (Q1710949) (← links)
- Restricted strong convexity implies weak submodularity (Q1990594) (← links)
- Support recovery of greedy block coordinate descent using the near orthogonality property (Q1992803) (← links)
- An algebraic perspective on integer sparse recovery (Q2007643) (← links)
- Stochastic greedy algorithms for multiple measurement vectors (Q2028927) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs (Q2036421) (← links)
- A data-driven line search rule for support recovery in high-dimensional data analysis (Q2157522) (← links)
- A new sufficient condition for sparse recovery with multiple orthogonal least squares (Q2157863) (← links)
- Generalized greedy alternatives (Q2175011) (← links)
- Iterative hard thresholding for compressed data separation (Q2190470) (← links)
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al. (Q2225318) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems (Q2335937) (← links)
- Greedy approximation in convex optimization (Q2343051) (← links)
- Greedy signal space methods for incoherence and beyond (Q2347895) (← links)
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension (Q2359687) (← links)
- Greedy strategies for convex optimization (Q2363679) (← links)
- Greedy-like algorithms for the cosparse analysis model (Q2437331) (← links)
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices (Q2437333) (← links)
- A novel sub-Nyquist FRI sampling and reconstruction method in linear canonical transform domain (Q2700473) (← links)
- Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems (Q2799920) (← links)
- Stability and Robustness of Weak Orthogonal Matching Pursuits (Q2840665) (← links)
- SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES (Q2879425) (← links)
- Suprema of Chaos Processes and the Restricted Isometry Property (Q2929397) (← links)
- A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery (Q2950600) (← links)
- Improved bounds for the RIP of Subsampled Circulant matrices (Q3379762) (← links)
- (Q4558147) (← links)
- A Tight Bound of Hard Thresholding (Q4558539) (← links)
- A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems (Q4586610) (← links)
- Sparse Approximation by Greedy Algorithms (Q4609500) (← links)
- Flavors of Compressive Sensing (Q4609797) (← links)
- Fusion frames and distributed sparsity (Q4686245) (← links)
- (Q4999097) (← links)
- The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials (Q5094726) (← links)
- A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property (Q5141286) (← links)
- (Q5149239) (← links)
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776) (← links)
- Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery (Q5380402) (← links)