For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution

DOI10.1002/CPA.20131zbMATH Open1105.90068OpenAlexW2114147096MaRDI QIDQ5486262FDOQ5486262

Publication date: 6 September 2006

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.20131

Recommendations

For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
Decoding by Linear Programming
Sparse recovery with pre-Gaussian random matrices
Stable signal recovery from incomplete and inaccurate measurements

zbMATH Keywords

combinatorial optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

Local operator theory, random matrices and Banach spaces.

Cited In (62)

A reliable iteration algorithm for one-bit compressive sensing on the unit sphere
A matrix-free fixed-point iteration for inverting cascade impactor measurements with instrument's sensitivity kernels and hardware
Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification
Feature selection when there are many influential features
An unbiased approach to compressed sensing
A linear system output transformation for sparse approximation
Variational method for super-resolution optical flow
Overcoming the limitations of phase transition by higher order analysis of regularization techniques
Sparse representations and approximation theory
Sparse approximate solution of partial differential equations
A differential equations approach to $l_{1}$-minimization with applications to array imaging
Sparsest representations and approximations of an underdetermined linear system
A gradient projection method for the sparse signal reconstruction in compressive sensing
High-dimensional generalized linear models and the lasso
Geometric separation by single-pass alternating thresholding
Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP
Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$
Breakdown of equivalence between the minimal $\ell^1$-norm solution and the sparsest solution
Stable high-order cubature formulas for experimental data
The residual method for regularizing ill-posed problems
Primal and dual alternating direction algorithms for $\ell _{1}$-$\ell _{1}$-norm minimization problems in compressive sensing
A new perspective on least squares under convex constraint
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
On perturbed steepest descent methods with inexact line search for bilevel convex optimization
Sparse recovery with pre-Gaussian random matrices
Gibbs phenomena for $L^q$-best approximation in finite element spaces
GPU accelerated greedy algorithms for compressed sensing
Fast $\ell _{1}$ minimization by iterative thresholding for multidimensional NMR spectroscopy
Augmented sparse reconstruction of protein signaling networks
Average case recovery analysis of tomographic compressive sensing
Decoding by Linear Programming
Microlocal analysis of the geometric separation problem
Inverse problems from biomedicine: inference of putative disease mechanisms and robust therapeutic strategies
Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
Sparse regularized learning in the reproducing kernel Banach spaces with the $\ell^1$ norm
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Sparse time-frequency representation based on multiwindow discrete Gabor transform
Sparse estimation from noisy observations of an overdetermined linear system
Linearized alternating directions method for $\ell_1$-norm inequality constrained $\ell_1$-norm minimization
Non-smooth equations based method for $\ell_1$-norm problems with applications to compressed sensing
On support sizes of restricted isometry constants
A framelet-based image inpainting algorithm
Mathematics of analog-to-digital conversion
$l_p$-recovery of the most significant subspace among multiple subspaces with outliers
Exact and approximate sparse solutions of underdetermined linear equations
Mean breakdown points for compressed sensing by uniformly distributed matrices
Fixed-time flocking formation of nonlinear multi-agent system with uncertain state perturbation
Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
Imaging with highly incomplete and corrupted data
Solve exactly an under determined linear system by minimizing least squares regularized with an $\ell_0$ penalty
An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
The sparsity and bias of the LASSO selection in high-dimensional linear regression
Consistencies and rates of convergence of jump-penalized least squares estimators
For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
Phase transitions in error correcting and compressed sensing by $\ell _{1}$ linear programming
Counting faces of randomly projected polytopes when the projection radically lowers dimension
Accurate solution to overdetermined linear equations with errors using $L_1$ norm minimization
Error localization of best $L_1$ polynomial approximants
Discussion: One-step sparse estimates in nonconcave penalized likelihood models
Sobolev duals for random frames and $\varSigma \varDelta $ quantization of compressed sensing measurements
The Dantzig selector and sparsity oracle inequalities
Hierachical Bayesian models and sparsity: $\ell_2$-magic

This page was built for publication: For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486262)