Decoding by Linear Programming

DOI10.1109/TIT.2005.858979zbMath1264.94121DBLPjournals/tit/CandesT05OpenAlexW2129131372WikidataQ98839711 ScholiaQ98839711MaRDI QIDQ3546644

Emmanuel J. Candès, Terence C. 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

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Decoding (94B35)

Related Items (only showing first 100 items - show all)

The gap between the null space property and the restricted isometry property ⋮ Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems ⋮ Regularity properties for sparse regression ⋮ Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets ⋮ Operator theoretic framework for optimal placement of sensors and actuators for control of nonequilibrium dynamics ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Stable signal recovery from phaseless measurements ⋮ The benefit of group sparsity in group inference with de-biased scaled group Lasso ⋮ Sparse solutions of linear complementarity problems ⋮ Compressed blind signal reconstruction model and algorithm ⋮ DC approximation approaches for sparse optimization ⋮ Coherence of sensing matrices coming from algebraic-geometric codes ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ The non-convex sparse problem with nonnegative constraint for signal reconstruction ⋮ Matrix sparsification and the sparse null space problem ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ Block sparse recovery via mixed \(l_2/l_1\) minimization ⋮ The essential ability of sparse reconstruction of different compressive sensing strategies ⋮ Influence factors of sparse microwave imaging radar system performance: approaches to waveform design and platform motion analysis ⋮ Sparse microwave imaging: principles and applications ⋮ Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain ⋮ Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization ⋮ The bounds of restricted isometry constants for low rank matrices recovery ⋮ Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization ⋮ \(s\)-goodness for low-rank matrix recovery ⋮ Clustering and feature selection using sparse principal component analysis ⋮ Sparsity and non-Euclidean embeddings ⋮ The Dantzig selector and sparsity oracle inequalities ⋮ Sparse recovery under matrix uncertainty ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ On exact recovery of sparse vectors from linear measurements ⋮ Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions ⋮ Nearly optimal minimax estimator for high-dimensional sparse linear regression ⋮ The \(L_1\) penalized LAD estimator for high dimensional linear regression ⋮ \(\ell_{1}\)-penalization for mixture regression models ⋮ Nonconvex compressed sampling of natural images and applications to compressed MR imaging ⋮ Recovery of sparsest signals via \(\ell^q \)-minimization ⋮ Phase transition in limiting distributions of coherence of high-dimensional random matrices ⋮ Error estimates for orthogonal matching pursuit and random dictionaries ⋮ Phase transitions for greedy sparse approximation algorithms ⋮ Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography ⋮ Testing the nullspace property using semidefinite programming ⋮ On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization ⋮ Null space conditions and thresholds for rank minimization ⋮ Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling ⋮ 2D sparse signal recovery via 2D orthogonal matching pursuit ⋮ Perturbations of measurement matrices and dictionaries in compressed sensing ⋮ Numerically erasure-robust frames ⋮ Average best \(m\)-term approximation ⋮ Compressive sensing of analog signals using discrete prolate spheroidal sequences ⋮ New bounds for RIC in compressed sensing ⋮ Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ 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 ⋮ System identification in the presence of outliers and random noises: a compressed sensing approach ⋮ Sparse time-frequency representation of nonlinear and nonstationary data ⋮ Robustness of orthogonal matching pursuit under restricted isometry property ⋮ Analysis of orthogonal multi-matching pursuit under restricted isometry property ⋮ A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization ⋮ The variational Garrote ⋮ Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) ⋮ Optimal computational and statistical rates of convergence for sparse nonconvex learning problems ⋮ A new perspective on least squares under convex constraint ⋮ Sparse dual frames and dual Gabor functions of minimal time and frequency supports ⋮ The road to deterministic matrices with the restricted isometry property ⋮ Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) ⋮ Extreme point inequalities and geometry of the rank sparsity ball ⋮ Compressive sensing using chaotic sequence based on Chebyshev map ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ 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 ⋮ Bayesian signal detection with compressed measurements ⋮ Kernel sparse representation for time series classification ⋮ On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery ⋮ Image reconstruction using analysis model prior ⋮ The sparsest solutions to \(Z\)-tensor complementarity problems ⋮ Convergence of iterative hard-thresholding algorithm with continuation ⋮ An iteratively approximated gradient projection algorithm for sparse signal reconstruction ⋮ Observability for initial value problems with sparse initial data ⋮ On uncertainty principles in the finite dimensional setting ⋮ Compressed sensing with coherent and redundant dictionaries ⋮ A semidefinite programming study of the Elfving theorem ⋮ Estimation of high-dimensional low-rank matrices ⋮ Estimation of (near) low-rank matrices with noise and high-dimensional scaling ⋮ Approximation of frame based missing data recovery ⋮ Nearly unbiased variable selection under minimax concave penalty ⋮ Selection by partitioning the solution paths ⋮ A unified approach to model selection and sparse recovery using regularized least squares ⋮ Orthogonal one step greedy procedure for heteroscedastic linear models ⋮ Analysis of a nonsmooth optimization approach to robust estimation ⋮ Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm ⋮ On solutions of sparsity constrained optimization

This page was built for publication: Decoding by Linear Programming