The following pages link to Compressed sensing (Q5900527):
Displaying 50 items.
- Sparsity reconstruction in electrical impedance tomography: an experimental evaluation (Q2428127) (← links)
- Complexity of approximation of functions of few variables in high dimensions (Q2431335) (← links)
- Anomaly detection in large-scale data stream networks (Q2435710) (← links)
- RIPless compressed sensing from anisotropic measurements (Q2437334) (← links)
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures (Q2437335) (← links)
- Average case recovery analysis of tomographic compressive sensing (Q2437338) (← links)
- Heat source identification based on \(\ell_1\) constrained minimization (Q2437931) (← links)
- Partial \(S\)-goodness for partially sparse signal recovery (Q2438325) (← links)
- Asymptotic equivalence of quantum state tomography and noisy matrix completion (Q2438759) (← links)
- A relaxed-PPA contraction method for sparse signal recovery (Q2440190) (← links)
- Further properties of \(\ell^p\) dimension (Q2444411) (← links)
- A note on the hardness of sparse approximation (Q2444766) (← links)
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials (Q2447624) (← links)
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications (Q2449220) (← links)
- Restricted isometry property for random matrices with heavy-tailed columns (Q2450279) (← links)
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints (Q2450861) (← links)
- Efficient algorithms for robust and stable principal component pursuit problems (Q2450901) (← links)
- Optimized projections for compressed sensing via rank-constrained nearest correlation matrix (Q2450944) (← links)
- Deterministic constructions of compressed sensing matrices (Q2465825) (← 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)
- The Littlewood-Offord problem and invertibility of random matrices (Q2483181) (← links)
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization (Q2509909) (← links)
- Learning in compressed space (Q2510741) (← links)
- Nesterov's algorithm solving dual formulation for compressed sensing (Q2511178) (← links)
- Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing'' (Q2511274) (← links)
- Fast and RIP-optimal transforms (Q2514234) (← links)
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames (Q2627887) (← links)
- On the interval of fluctuation of the singular values of random matrices (Q2628338) (← links)
- The Moreau envelope based efficient first-order methods for sparse recovery (Q2628357) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- Alternating direction method of multipliers for \(\ell_{1}\)-\(\ell_{2}\)-regularized logistic regression model (Q2630840) (← links)
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q2632508) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- An efficient augmented Lagrangian method with applications to total variation minimization (Q2636603) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Exact matrix completion via convex optimization (Q2655288) (← links)
- Nonlinear regularization techniques for seismic tomography (Q2655679) (← links)
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery (Q2656664) (← links)
- A theoretical result of sparse signal recovery via alternating projection method (Q2656767) (← links)
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing (Q2658730) (← links)
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE (Q2659717) (← links)
- Sparse non-negative super-resolution -- simplified and stabilised (Q2659719) (← links)
- An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
- Stable super-resolution limit and smallest singular value of restricted Fourier matrices (Q2659732) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? (Q2659754) (← links)
- The Nyquist sampling rate for spiraling curves (Q2659757) (← links)
- Approximate super-resolution of positive measures in all dimensions (Q2659760) (← links)
- Linear matrix inequalities in control systems with uncertainty (Q2660497) (← links)
