Decoding by Linear Programming
From MaRDI portal
Publication:3546644
DOI10.1109/TIT.2005.858979zbMATH Open1264.94121DBLPjournals/tit/CandesT05OpenAlexW2129131372WikidataQ98839711 ScholiaQ98839711MaRDI QIDQ3546644FDOQ3546644
Authors: Emmanuel J. Candès, Terence Tao 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.858979
Recommendations
- Stable signal recovery from incomplete and inaccurate measurements
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Highly Robust Error Correction byConvex Programming
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Decoding (94B35)
Cited In (only showing first 100 items - show all)
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Robust estimation for an inverse problem arising in multiview geometry
- Nonconvex compressed sampling of natural images and applications to compressed MR imaging
- Multi-stage convex relaxation for feature selection
- On the size of incoherent systems
- A dual split Bregman method for fast \(\ell ^{1}\) minimization
- Error estimates for orthogonal matching pursuit and random dictionaries
- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- Letter to the editor: ``On exact recovery of sparse vectors from linear measurements
- 2D sparse signal recovery via 2D orthogonal matching pursuit
- Instance-optimality in probability with an \(\ell _1\)-minimization decoder
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Average best \(m\)-term approximation
- Sparse solutions of a class of constrained optimization problems
- Optimal \(D\)-RIP bounds in compressed sensing
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- New bounds for RIC in compressed sensing
- Sparse recovery with pre-Gaussian random matrices
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Sparse recovery on Euclidean Jordan algebras
- Title not available (Why is that?)
- Sparse time-frequency representation of nonlinear and nonstationary data
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- The variational Garrote
- Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports
- Greedy forward regression for variable screening
- Gaussian averages of interpolated bodies and applications to approximate reconstruction
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Extreme point inequalities and geometry of the rank sparsity ball
- Compressive sensing using chaotic sequence based on Chebyshev map
- On the sparseness of 1-norm support vector machines
- Three deterministic constructions of compressed sensing matrices with low coherence
- Compressed sensing of low-rank plus sparse matrices
- \(s\)-goodness for low-rank matrix recovery
- Foveated compressive imaging for low power vehicle fingerprinting and tracking in aerial imagery
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
- Kernel sparse representation for time series classification
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- Sparsity and non-Euclidean embeddings
- On exact recovery of sparse vectors from linear measurements
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
- A sharp RIP condition for orthogonal matching pursuit
- New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization
- Numerically erasure-robust frames
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Minimizers of sparsity regularized Huber loss function
- Sorted concave penalized regression
- Guarantees of Riemannian optimization for low rank matrix recovery
- Sparse approximate solution of partial differential equations
- Gaining Outlier Resistance With Progressive Quantiles: Fast Algorithms and Theoretical Studies
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- A regularized correntropy framework for robust pattern recognition
- Cross validation in Lasso and its acceleration
- Sparse and low-rank multivariate Hawkes processes
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- Low complexity regularization of linear inverse problems
- Proximal mapping for symmetric penalty and sparsity
- Sensitivity analysis for mirror-stratifiable convex functions
- A tight bound of hard thresholding
- Level set methods for stochastic discontinuity detection in nonlinear problems
- On the computation of sparse solutions to the controllability problem for discrete-time linear systems
- Estimation of block sparsity in compressive sensing
- Surface Reconstruction via L 1-Minimization
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Robust multi-image processing with optimal sparse regularization
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- GPU accelerated greedy algorithms for compressed sensing
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- High-dimensional Gaussian model selection on a Gaussian design
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization
- Optimal dual certificates for noise robustness bounds in compressive sensing
- Stability of the elastic net estimator
- Resolution analysis of imaging with \(\ell_1\) optimization
- Decoding low-dimensional linear codes by linear programming
- Random sampling and reconstruction of sparse time- and band-limited signals
- Sampling in the analysis transform domain
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- Sharp non-asymptotic performance bounds for \(\ell_1\) and Huber robust regression estimators
- From compression to compressed sensing
- Regularized sparse representation for image deconvolution
- Primal-dual first-order methods for a class of cone programming
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
This page was built for publication: Decoding by Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546644)
