The following pages link to Decoding by Linear Programming (Q3546644):
Displayed 50 items.
- Compressive sensing of analog signals using discrete prolate spheroidal sequences (Q448495) (← links)
- New bounds for RIC in compressed sensing (Q457549) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms (Q466526) (← links)
- Stable recovery of sparse signals via \(\ell_p\)-minimization (Q466983) (← links)
- Sparse recovery on Euclidean Jordan algebras (Q471921) (← links)
- System identification in the presence of outliers and random noises: a compressed sensing approach (Q473320) (← links)
- Sparse time-frequency representation of nonlinear and nonstationary data (Q476519) (← links)
- Robustness of orthogonal matching pursuit under restricted isometry property (Q476748) (← links)
- Analysis of orthogonal multi-matching pursuit under restricted isometry property (Q477291) (← links)
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization (Q477827) (← links)
- The variational Garrote (Q479478) (← links)
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) (Q479885) (← links)
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875) (← links)
- A new perspective on least squares under convex constraint (Q482891) (← links)
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports (Q485118) (← links)
- The road to deterministic matrices with the restricted isometry property (Q485193) (← links)
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing (Q492558) (← links)
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283) (← links)
- Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
- Compressive sensing using chaotic sequence based on Chebyshev map (Q494825) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Foveated compressive imaging for low power vehicle fingerprinting and tracking in aerial imagery (Q507263) (← links)
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing (Q508757) (← links)
- Bayesian signal detection with compressed measurements (Q508772) (← links)
- Kernel sparse representation for time series classification (Q508940) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- Image reconstruction using analysis model prior (Q519588) (← links)
- The sparsest solutions to \(Z\)-tensor complementarity problems (Q519760) (← links)
- Convergence of iterative hard-thresholding algorithm with continuation (Q523178) (← links)
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction (Q529940) (← links)
- Observability for initial value problems with sparse initial data (Q533508) (← links)
- On uncertainty principles in the finite dimensional setting (Q541940) (← links)
- Compressed sensing with coherent and redundant dictionaries (Q544040) (← links)
- A semidefinite programming study of the Elfving theorem (Q546096) (← links)
- Estimation of high-dimensional low-rank matrices (Q548539) (← links)
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
- Approximation of frame based missing data recovery (Q550489) (← links)
- The Dantzig selector and sparsity oracle inequalities (Q605023) (← links)
- Sparse recovery under matrix uncertainty (Q605921) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- \(\ell_{1}\)-penalization for mixture regression models (Q619141) (← links)
- Error estimates for orthogonal matching pursuit and random dictionaries (Q628676) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Testing the nullspace property using semidefinite programming (Q633104) (← links)
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
- Null space conditions and thresholds for rank minimization (Q633114) (← links)
- Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling (Q634656) (← links)