Pages that link to "Item:Q1039884"
From MaRDI portal
The following pages link to A simple proof of the restricted isometry property for random matrices (Q1039884):
Displaying 50 items.
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery (Q2124653) (← links)
- Sparse high-dimensional linear regression. Estimating squared error and a phase transition (Q2131259) (← links)
- On the optimization landscape of tensor decompositions (Q2144549) (← links)
- Bayesian factor-adjusted sparse regression (Q2155305) (← links)
- A new sufficient condition for sparse recovery with multiple orthogonal least squares (Q2157863) (← links)
- Phase retrieval by binary questions: which complementary subspace is closer? (Q2165571) (← links)
- Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion (Q2185044) (← links)
- Iterative hard thresholding for compressed data separation (Q2190470) (← links)
- Deterministic construction of compressed sensing matrices from constant dimension codes (Q2197399) (← links)
- Effective zero-norm minimization algorithms for noisy compressed sensing (Q2198627) (← links)
- Three deterministic constructions of compressed sensing matrices with low coherence (Q2202898) (← links)
- Bipolar measurement matrix using chaotic sequence (Q2207348) (← links)
- Stability of 1-bit compressed sensing in sparse data reconstruction (Q2217038) (← links)
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise (Q2223572) (← links)
- Stable restoration and separation of approximately sparse signals (Q2252500) (← links)
- Convergence rates of learning algorithms by random projection (Q2252501) (← links)
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO (Q2252508) (← links)
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit (Q2254767) (← links)
- Stability and instance optimality for Gaussian measurements in compressed sensing (Q2269902) (← links)
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\) (Q2273889) (← links)
- Construction of highly redundant incoherent unit norm tight frames as a union of orthonormal bases (Q2274406) (← links)
- On rank awareness, thresholding, and MUSIC for joint sparse recovery (Q2278470) (← links)
- An effective algorithm for the spark of sparse binary measurement matrices (Q2287709) (← links)
- Analysis of compressed distributed adaptive filters (Q2288711) (← links)
- Erasure recovery matrices for encoder protection (Q2300758) (← links)
- Learning directed acyclic graph SPNs in sub-quadratic time (Q2310290) (← links)
- Deterministic constructions of compressed sensing matrices based on codes (Q2311429) (← links)
- On the strong restricted isometry property of Bernoulli random matrices (Q2315024) (← links)
- Sparse reconstruction with multiple Walsh matrices (Q2317908) (← links)
- A simple Gaussian measurement bound for exact recovery of block-sparse signals (Q2320652) (← links)
- Sampling strategies for uncertainty reduction in categorical random fields: formulation, mathematical analysis and application to multiple-point simulations (Q2325286) (← links)
- Lattices from tight frames and vertex transitive graphs (Q2325750) (← links)
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization (Q2330928) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Weaker regularity conditions and sparse recovery in high-dimensional regression (Q2336858) (← links)
- On some aspects of approximation of ridge functions (Q2344299) (← links)
- New analysis of manifold embeddings and signal recovery from compressive measurements (Q2347898) (← links)
- Optimal \(D\)-RIP bounds in compressed sensing (Q2353238) (← links)
- A novel measurement matrix based on regression model for block compressed sensing (Q2353426) (← links)
- Use of EM algorithm for data reduction under sparsity assumption (Q2358925) (← links)
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization (Q2375016) (← links)
- Recovery error analysis of noisy measurement in compressed sensing (Q2398228) (← links)
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645) (← links)
- A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
- Improved RIP conditions for compressed sensing with coherent tight frames (Q2403862) (← links)
- Capturing ridge functions in high dimensions from point queries (Q2428577) (← 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)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
