The following pages link to Decoding by Linear Programming (Q3546644):
Displaying 50 items.
- Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing (Q5020144) (← links)
- An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators (Q5021408) (← links)
- Decoding from Pooled Data: Sharp Information-Theoretic Bounds (Q5025779) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Optimizing Sparsity over Lattices and Semigroups (Q5041733) (← links)
- A general theory for subspace-sparse recovery (Q5052922) (← links)
- Estimation of block sparsity in compressive sensing (Q5052929) (← links)
- (Q5053206) (← links)
- On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations (Q5060698) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations (Q5071437) (← links)
- The Noise Collector for sparse recovery in high dimensions (Q5073060) (← links)
- A polynomial algorithm for best-subset selection problem (Q5073242) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- Image Segmentation via Fischer-Burmeister Total Variation and Thresholding (Q5077133) (← links)
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems (Q5077161) (← links)
- Random Sampling and Reconstruction of Sparse Time- and Band-Limited Signals (Q5085209) (← links)
- Performance analysis for unconstrained analysis based approaches* (Q5097569) (← links)
- Asymptotic Theory of \(\boldsymbol \ell _1\) -Regularized PDE Identification from a Single Noisy Trajectory (Q5097857) (← links)
- Recovery analysis for block ℓp − ℓ1 minimization with prior support information (Q5097858) (← links)
- Robust recovery of a kind of weighted l1-minimization without noise level (Q5097878) (← links)
- (Q5104111) (← links)
- Nonlinear Iterative Hard Thresholding for Inverse Scattering (Q5108466) (← links)
- $N$-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry (Q5108470) (← links)
- On the distribution of an arbitrary subset of the eigenvalues for some finite dimensional random matrices (Q5108687) (← links)
- Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit (Q5121287) (← links)
- Robust recovery of signals with partially known support information using weighted BPDN (Q5132234) (← links)
- An unbiased approach to compressed sensing (Q5132273) (← links)
- Generalized Regression Estimators with High-Dimensional Covariates (Q5134471) (← links)
- Stability analysis of a class of sparse optimization problems (Q5135257) (← links)
- Inferring Sparse Preference Lists from Partial Information (Q5141707) (← links)
- A Sampling Theorem for Deconvolution in Two Dimensions (Q5143314) (← links)
- Distance-Sparsity Transference for Vertices of Corner Polyhedra (Q5147026) (← links)
- Sparsity Promoting Hybrid Solvers for Hierarchical Bayesian Inverse Problems (Q5147967) (← links)
- (Q5148989) (← links)
- Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing (Q5149553) (← links)
- Error Localization of Best $L_{1}$ Polynomial Approximants (Q5151924) (← links)
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials (Q5160076) (← links)
- The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices (Q5170951) (← links)
- A Regularized Correntropy Framework for Robust Pattern Recognition (Q5198613) (← links)
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems (Q5210512) (← links)
- (Q5214193) (← links)
- (Q5214233) (← links)
- An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems (Q5216783) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms (Q5219700) (← links)
- Weak Stability of <i>ℓ</i><sub>1</sub>-Minimization Methods in Sparse Data Reconstruction (Q5219713) (← links)
- An improved bound of cumulative coherence for signal recovery (Q5221431) (← links)
- Minimization of the difference of Nuclear and Frobenius norms for noisy low rank matrix recovery (Q5221434) (← links)
