Pages that link to "Item:Q4544728"
From MaRDI portal
The following pages link to Uncertainty principles and ideal atomic decomposition (Q4544728):
Displaying 50 items.
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- Sparse linear regression from perturbed data (Q2208606) (← links)
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise (Q2223572) (← links)
- Sparse regression: scalable algorithms and empirical performance (Q2225311) (← links)
- Analysis of inpainting via clustered sparsity and microlocal analysis (Q2251216) (← links)
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices (Q2251220) (← links)
- Sharp RIP bound for sparse signal and low-rank matrix recovery (Q2252129) (← links)
- Geometric separation by single-pass alternating thresholding (Q2252176) (← links)
- Stable restoration and separation of approximately sparse signals (Q2252500) (← links)
- Fast thresholding algorithms with feedbacks for sparse signal recovery (Q2252504) (← links)
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit (Q2254767) (← links)
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
- Ways to sparse representation: An overview (Q2267103) (← links)
- A numerical exploration of compressed sampling recovery (Q2267399) (← links)
- On the differences between \(L_2\) boosting and the Lasso (Q2288790) (← links)
- Novel harmonic regularization approach for variable selection in Cox's proportional hazards model (Q2330191) (← links)
- Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity (Q2330192) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
- An asymptotic existence result on compressed sensing matrices (Q2347356) (← links)
- Stable recovery of analysis based approaches (Q2347901) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- The asymptotic distribution and Berry-Esseen bound of a new test for independence in high dimension with an application to stochastic optimization (Q2378634) (← links)
- A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
- Compressed sensing for finite-valued signals (Q2401311) (← links)
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions (Q2424501) (← links)
- Support union recovery in high-dimensional multivariate regression (Q2429923) (← links)
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization (Q2434980) (← links)
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures (Q2437335) (← links)
- Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
- Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices (Q2447336) (← links)
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708) (← links)
- On the uncertainty inequality as applied to discrete signals (Q2468957) (← links)
- Beyond coherence: Recovering structured time-frequency representations (Q2470546) (← links)
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). (Q2473068) (← links)
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them (Q2497239) (← links)
- Robust multi-image processing with optimal sparse regularization (Q2515365) (← links)
- A wavelet-based hybrid approach to estimate variance function in heteroscedastic regression models (Q2516632) (← links)
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA) (Q2581449) (← links)
- A novel regularization based on the error function for sparse recovery (Q2660696) (← links)
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression (Q2687439) (← links)
- On sparse recovery algorithms in unions of orthonormal bases (Q2696630) (← links)
- Posterior information-based image measurement matrix optimization (Q2697739) (← links)
- On the sparsity of Lasso minimizers in sparse data recovery (Q2700886) (← links)
- Basis pursuit for frequency-domain identification (Q2786711) (← links)
- Compressive Sensing (Q2789803) (← links)
- Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
- DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
- The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization (Q2846490) (← links)
