Decoding by Linear Programming

DOI10.1109/TIT.2005.858979zbMath1264.94121WikidataQ98839711 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)

Mathematics Subject Classification ID

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

94B35: Decoding

Related Items

The convex geometry of linear inverse problems, Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays, Strengthening hash families and compressive sensing, Robust estimation for an inverse problem arising in multiview geometry, Full spark frames, Sparse total least squares: analysis and greedy algorithms, Compressed sensing and matrix completion with constant proportion of corruptions, An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration, Minimax risks for sparse regressions: ultra-high dimensional phenomenons, Estimation of Gaussian graphs by model selection, On the conditions used to prove oracle results for the Lasso, The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso), Restricted \(p\)-isometry properties of partially sparse signal recovery, A short note on compressed sensing with partially known signal support, The landscape of empirical risk for nonconvex losses, Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem, Sparse approximation of fitting surface by elastic net, A sharp RIP condition for orthogonal matching pursuit, An augmented Lagrangian algorithm for total bounded variation regularization based image deblurring, The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement, Sharp RIP bound for sparse signal and low-rank matrix recovery, A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, Stable restoration and separation of approximately sparse signals, Fast thresholding algorithms with feedbacks for sparse signal recovery, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Sparse signals recovery from noisy measurements by orthogonal matching pursuit, Every Hilbert space frame has a Naimark complement, Sparse trace norm regularization, Necessary and sufficient conditions of solution uniqueness in 1-norm minimization, Sparse-view ultrasound diffraction tomography using compressed sensing with nonuniform FFT, Cirrhosis classification based on texture classification of random features, A numerical exploration of compressed sampling recovery, Stability and instance optimality for Gaussian measurements in compressed sensing, On some aspects of approximation of ridge functions, Near oracle performance and block analysis of signal space greedy methods, Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction, Greedy signal space methods for incoherence and beyond, New analysis of manifold embeddings and signal recovery from compressive measurements, Stable recovery of analysis based approaches, Sparse learning via Boolean relaxations, An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, Optimal \(D\)-RIP bounds in compressed sensing, The sparsest solution to the system of absolute value equations, On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery, Optimality conditions for sparse nonlinear programming, Greedy strategies for convex optimization, Further properties of the forward-backward envelope with applications to difference-of-convex programming, Split Bregman iteration algorithm for image deblurring using fourth-order total bounded variation regularization model, Compressed sensing by inverse scale space and curvelet thresholding, Reconstruction of sparse signals in impulsive disturbance environments, Error bounds for compressed sensing algorithms with group sparsity: A unified approach, Explicit universal sampling sets in finite vector spaces, A new bound on the block restricted isometry constant in compressed sensing, Adaptive step-size matching pursuit algorithm for practical sparse reconstruction, Improved RIP conditions for compressed sensing with coherent tight frames, The modified accelerated Bregman method for regularized basis pursuit problem, A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing, Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, Model identification of a network as compressing sensing, Noncommutative Bennett and Rosenthal inequalities, Randomized first order algorithms with applications to \(\ell _{1}\)-minimization, Multi-stage convex relaxation for feature selection, Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices, On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures, Heat source identification based on \(\ell_1\) constrained minimization, Partial \(S\)-goodness for partially sparse signal recovery, Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications, Restricted isometry property for random matrices with heavy-tailed columns, Optimized projections for compressed sensing via rank-constrained nearest correlation matrix, Deterministic constructions of compressed sensing matrices, Gaussian averages of interpolated bodies and applications to approximate reconstruction, The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder)., \(L^{1}\)-minimization methods for Hamilton-Jacobi equations: the one-dimensional case, Learning in compressed space, Robust multi-image processing with optimal sparse regularization, On the interval of fluctuation of the singular values of random matrices, The Moreau envelope based efficient first-order methods for sparse recovery, Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization, Exact matrix completion via convex optimization, Unnamed Item, Restricted isometry property for matrices whose entries are random variables belonging to some Orlicz spaces $L_U(\Omega )$, Duality and Convex Programming, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, Resolution Analysis of Imaging with $\ell_1$ Optimization, Low Complexity Regularization of Linear Inverse Problems, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms, Sparse PCA: Convex Relaxations, Algorithms and Applications, Motion Averaging in 3D Reconstruction Problems, Correcting Data Corruption Errors for Multivariate Function Approximation, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, A perturbation analysis of block-sparse compressed sensing via mixed ℓ2/ℓ1 minimization, On Low Rank Approximation of Linear Operators in p-Norms and Some Algorithms, Identification of interactions in fractional-order systems with high dimensions, Sparse Sensor Placement Optimization for Classification, Fast Implementation of ℓ 1-Greedy Algorithm, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming, Sparsest representations and approximations of an underdetermined linear system, Multicompartment magnetic resonance fingerprinting, An efficient superpixel-based sparse representation framework for hyperspectral image classification, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Guarantees of total variation minimization for signal recovery, Time for dithering: fast and quantized random embeddings via the restricted isometry property, Super-resolution of point sources via convex programming, A null-space-based weightedl₁minimization approach to compressed sensing, Proximal Mapping for Symmetric Penalty and Sparsity, Flavors of Compressive Sensing, Batched Stochastic Gradient Descent with Weighted Sampling, Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration, Inverse scale space decomposition, Greedy forward regression for variable screening, Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis, What is a Frame? Theory and Applications of Frames, A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, An adaptive inverse scale space method for compressed sensing, $\ell _0$ Minimization for wavelet frame based image restoration, ELASTIC-NET REGULARIZATION FOR LOW-RANK MATRIX RECOVERY, Deterministic Construction of Compressed Sensing Matrices from Codes, Decoupling noise and features via weighted ℓ ₁ -analysis compressed sensing, Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices, A Regularized Correntropy Framework for Robust Pattern Recognition, Quasi-linear Compressed Sensing, Minimization of $\ell_{1-2}$ for Compressed Sensing, Euclidean arrangements in Banach spaces, The Restricted Isometry Property of Subsampled Fourier Matrices, Compressive Sampling for Energy Spectrum Estimation of Turbulent Flows, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels, Nonuniform recovery of fusion frame structured sparse signals, Dynamical sampling in multiply generated shift-invariant spaces, Stable recovery of sparse signals with coherent tight frames via lp-analysis approach, A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions, Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm, A dual split Bregman method for fast $\ell ^1$ minimization, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Recovery of low-rank matrices based on the rank null space properties, CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY, Towards a Mathematical Theory of Super‐resolution, A time continuation based fast approximate algorithm for compressed sensing related optimization, Sparse Solutions of Linear Diophantine Equations, Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT), Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices, Compressed sensing, Structured sparsity through convex optimization, A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers, A general theory of concave regularization for high-dimensional sparse estimation problems, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, SPARSE RECONSTRUCTION OF HARDY SIGNAL AND APPLICATIONS TO TIME-FREQUENCY DISTRIBUTION, Sparse Representation of Signals in Hardy Space, Primal–dual first-order methods for a class of cone programming, On sparse representation of analytic signal in Hardy space, PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ₁ LINEAR PROGRAMMING, SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY, An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model, Performance comparisons of greedy algorithms in compressed sensing, A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery, Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems, Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1, Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation, Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, Necessary and sufficient conditions for linear convergence of ℓ1-regularization, Counting faces of randomly projected polytopes when the projection radically lowers dimension, Compressed sensing and best 𝑘-term approximation, COMPRESSED SENSING BY ITERATIVE THRESHOLDING OF GEOMETRIC WAVELETS: A COMPARING STUDY, CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING, A review on restoration of seismic wavefields based on regularization and compressive sensing, On perturbed steepest descent methods with inexact line search for bilevel convex optimization, Multilevel preconditioning and adaptive sparse solution of inverse problems, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Identifying small mean-reverting portfolios, Optimal Experimental Design for Inverse Problems with State Constraints, Fast Phase Retrieval from Local Correlation Measurements, Illumination Strategies for Intensity-Only Imaging, Dictionary-Based Classification Models. Applications for Multichannel Neural Activity Analysis, Fast sparse reconstruction: Greedy inverse scale space flows, Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit, Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging, Compressive Sensing with Redundant Dictionaries and Structured Measurements, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES, Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation, On the Doubly Sparse Compressed Sensing Problem, A Survey of Compressed Sensing, Compressed Sensing, Sparse Inversion, and Model Mismatch, Regularized sparse representation for image deconvolution, Statistical challenges of high-dimensional data, Surface Reconstruction via L 1-Minimization, 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, 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, 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, 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, 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, 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, The Dantzig selector and sparsity oracle inequalities, Sparse recovery under matrix uncertainty, Approximation accuracy, gradient methods, and error bound for structured convex optimization, \(\ell_{1}\)-penalization for mixture regression models, Error estimates for orthogonal matching pursuit and random dictionaries, Phase transitions for greedy sparse approximation algorithms, 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, Explicit constructions of RIP matrices and related problems, Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices, Geometry of log-concave ensembles of random matrices and approximate reconstruction, Democracy in action: quantization, saturation, and compressive sensing, New bounds on the restricted isometry constant \(\delta _{2k}\), A note on the complexity of \(L _{p }\) minimization, Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\), Steiner equiangular tight frames, Nonlinear frames and sparse reconstructions in Banach spaces, Restricted \(p\)-isometry property and its application for nonconvex compressive sensing, On support sizes of restricted isometry constants, Improved bounds for restricted isometry constants, On the size of incoherent systems, A convergent relaxation of the Douglas-Rachford algorithm, New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints, Enhancing sparsity of Hermite polynomial expansions by iterative rotations, Construction of a full row-rank matrix system for multiple scanning directions in discrete tomography, Instance-optimality in probability with an \(\ell _1\)-minimization decoder, Analysis of basis pursuit via capacity sets, Enhancing sparsity by reweighted \(\ell _{1}\) minimization, Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference, Overcomplete blind source separation based on generalized Gaussian function and SL0 norm, A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing, Phase retrieval for sparse signals, Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals, On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals, GPU accelerated greedy algorithms for compressed sensing, Functional linear regression that's interpretable, Some sharp performance bounds for least squares regression with \(L_1\) regularization, Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy, A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Efficient nonconvex sparse group feature selection via continuous and discrete optimization, Optimal dual certificates for noise robustness bounds in compressive sensing, Approximation of rectangular beta-Laguerre ensembles and large deviations, Stability of the elastic net estimator, Sampling in the analysis transform domain, Sharp non-asymptotic performance bounds for \(\ell_1\) and Huber robust regression estimators, Interpolation via weighted \(\ell_{1}\) minimization, From compression to compressed sensing, A strong restricted isometry property, with an application to phaseless compressed sensing, A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery, The restricted isometry property and its implications for compressed sensing, A remark on compressed sensing, Sparse approximate solution of partial differential equations, Sparse recovery by non-convex optimization - instance optimality, A note on guaranteed sparse recovery via \(\ell_1\)-minimization, High-dimensional Gaussian model selection on a Gaussian design, The benefit of group sparsity, Lasso-type recovery of sparse representations for high-dimensional data, Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\), Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit, Random projections of smooth manifolds, Sparse solutions to underdetermined Kronecker product systems, A simple proof of the restricted isometry property for random matrices, Uniform uncertainty principle for Bernoulli and subgaussian ensembles, Gaussian polytopes: a cumulant-based approach, Observable dictionary learning for high-dimensional statistical inference, A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints, Sparse approximate solution of fitting surface to scattered points by MLASSO model, Compressed sensing for real measurements of quaternion signals, Sparsity and independence: balancing two objectives in optimization for source separation with application to fMRI analysis, Compressed sensing of data with a known distribution, Expander \(\ell_0\)-decoding, \(l_{0}\)-norm based structural sparse least square regression for feature selection, Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP, Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression, Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming, Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions, The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector, Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization, Online fault diagnosis for nonlinear power systems, Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization, A hierarchical framework for recovery in compressive sensing, Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization, Deterministic construction of compressed sensing matrices based on semilattices, Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity, A Rice method proof of the null-space property over the Grassmannian, A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit, Random matrices and erasure robust frames, A group adaptive elastic-net approach for variable selection in high-dimensional linear regression, Learning data discretization via convex optimization, Sparse signal recovery with prior information by iterative reweighted least squares algorithm, A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation, Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\), A probabilistic learning algorithm for robust modeling using neural networks with random weights, DC formulations and algorithms for sparse optimization problems, Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing, Iterative reweighted methods for \(\ell _1-\ell _p\) minimization, The noncooperative transportation problem and linear generalized Nash games, Support vector machines regression with \(l^1\)-regularizer, On the sparseness of 1-norm support vector machines, On finding a generalized lowest rank solution to a linear semi-definite feasibility problem, Approximately normalized iterative hard thresholding for nonlinear compressive sensing, Compressive sensing in signal processing: algorithms and transform domain formulations, Efficient extreme learning machine via very sparse random projection, An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors