Pages that link to "Item:Q5486262"

The following pages link to For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution (Q5486262):

Displaying 50 items.

• Feature selection when there are many influential features (Q396025) (← links)
• The residual method for regularizing ill-posed problems (Q425458) (← links)
• Sparse estimation from noisy observations of an overdetermined linear system (Q473308) (← links)
• A new perspective on least squares under convex constraint (Q482891) (← links)
• \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers (Q485350) (← links)
• Variational method for super-resolution optical flow (Q537249) (← links)
• Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
• The Dantzig selector and sparsity oracle inequalities (Q605023) (← links)
• Sparse representations and approximation theory (Q630502) (← links)
• Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty (Q650854) (← links)
• On support sizes of restricted isometry constants (Q711053) (← links)
• GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
• Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy (Q836250) (← links)
• The sparsity and bias of the LASSO selection in high-dimensional linear regression (Q939654) (← links)
• Sparse approximate solution of partial differential equations (Q972312) (← links)
• Consistencies and rates of convergence of jump-penalized least squares estimators (Q1002154) (← links)
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) (Q1012556) (← links)
• Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution (Q1027252) (← links)
• Parsimonious least norm approximation (Q1273417) (← links)
• Augmented sparse reconstruction of protein signaling networks (Q1798095) (← links)
• Accurate solution to overdetermined linear equations with errors using \(L_1\) norm minimization (Q1841564) (← links)
• An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems (Q1932970) (← links)
• Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements (Q1946588) (← links)
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
• Overcoming the limitations of phase transition by higher order analysis of regularization techniques (Q1991696) (← links)
• A linear system output transformation for sparse approximation (Q2103842) (← links)
• Stable high-order cubature formulas for experimental data (Q2133503) (← links)
• Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere (Q2175023) (← links)
• Geometric separation by single-pass alternating thresholding (Q2252176) (← links)
• Inverse problems from biomedicine: inference of putative disease mechanisms and robust therapeutic strategies (Q2376849) (← links)
• High-dimensional generalized linear models and the lasso (Q2426617) (← links)
• Average case recovery analysis of tomographic compressive sensing (Q2437338) (← links)
• A framelet-based image inpainting algorithm (Q2476267) (← links)
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization (Q2509909) (← links)
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
• Sparse regularized learning in the reproducing kernel Banach spaces with the \(\ell^1\) norm (Q2668579) (← links)
• Mean breakdown points for compressed sensing by uniformly distributed matrices (Q2843151) (← links)
• Phase transitions in error correcting and compressed sensing by \(\ell _{1}\) linear programming (Q2868199) (← links)
• Sparse recovery with pre-Gaussian random matrices (Q3066329) (← links)
• Counting faces of randomly projected polytopes when the projection radically lowers dimension (Q3079190) (← links)
• On perturbed steepest descent methods with inexact line search for bilevel convex optimization (Q3112499) (← links)
• Decoding by Linear Programming (Q3546644) (← links)
• Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP (Q3650548) (← links)
• Sparsest representations and approximations of an underdetermined linear system (Q4569345) (← links)
• Hierachical Bayesian models and sparsity: <i>ℓ</i> ₂ -magic (Q4625206) (← links)
• Mathematics of Analog‐to‐Digital Conversion (Q4650167) (← links)
• Sparse time-frequency representation based on multiwindow discrete Gabor transform (Q4689134) (← links)
• Microlocal Analysis of the Geometric Separation Problem (Q4902774) (← links)
• Gibbs phenomena for L<i>^q</i>-best approximation in finite element spaces (Q5034778) (← links)
• Error Localization of Best $L_{1}$ Polynomial Approximants (Q5151924) (← links)