For most large underdetermined systems of equations, the minimal š1ānorm nearāsolution approximates the sparsest nearāsolution
From MaRDI portal
Publication:5486262
DOI10.1002/CPA.20131zbMath1105.90068OpenAlexW2114147096MaRDI QIDQ5486262
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
Related Items (43)
Gibbs phenomena for Lq-best approximation in finite element spaces ā® Stable high-order cubature formulas for experimental data ā® Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy ā® Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique ā® 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 ā® The Dantzig selector and sparsity oracle inequalities ā® Sparse regularized learning in the reproducing kernel Banach spaces with the \(\ell^1\) norm ā® Feature selection when there are many influential features ā® An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems ā® Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification ā® High-dimensional generalized linear models and the lasso ā® Fixed-time flocking formation of nonlinear multi-agent system with uncertain state perturbation ā® Sparse representations and approximation theory ā® The residual method for regularizing ill-posed problems ā® Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements ā® Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing ā® Average case recovery analysis of tomographic compressive sensing ā® A gradient projection method for the sparse signal reconstruction in compressive sensing ā® Hierachical Bayesian models and sparsity: ā 2 -magic ā® A new perspective on least squares under convex constraint ā® \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers ā® The sparsity and bias of the LASSO selection in high-dimensional linear regression ā® Microlocal Analysis of the Geometric Separation Problem ā® Overcoming the limitations of phase transition by higher order analysis of regularization techniques ā® Mathematics of AnalogātoāDigital Conversion ā® A framelet-based image inpainting algorithm ā® Geometric separation by single-pass alternating thresholding ā® Variational method for super-resolution optical flow ā® Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing ā® Sparse approximate solution of partial differential equations ā® On support sizes of restricted isometry constants ā® Sparse time-frequency representation based on multiwindow discrete Gabor transform ā® Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization ā® Consistencies and rates of convergence of jump-penalized least squares estimators ā® Augmented sparse reconstruction of protein signaling networks ā® Counting faces of randomly projected polytopes when the projection radically lowers dimension ā® GPU accelerated greedy algorithms for compressed sensing ā® Discussion: One-step sparse estimates in nonconcave penalized likelihood models ā® Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP ā® On perturbed steepest descent methods with inexact line search for bilevel convex optimization ā® A matrix-free fixed-point iteration for inverting cascade impactor measurements with instrument's sensitivity kernels and hardware ā® PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ā1 LINEAR PROGRAMMING
Cites Work
This page was built for publication: For most large underdetermined systems of equations, the minimal š1ānorm nearāsolution approximates the sparsest nearāsolution
