Pages that link to "Item:Q5471032"
From MaRDI portal
The following pages link to For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution (Q5471032):
Displaying 46 items.
- Latent variable graphical model selection via convex optimization (Q132216) (← links)
- The first-order necessary conditions for sparsity constrained optimization (Q259127) (← links)
- Sparse network identifiability via compressed sensing (Q273889) (← links)
- Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems (Q276859) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint (Q286265) (← links)
- Image reconstruction from undersampled Fourier data using the polynomial annihilation transform (Q292541) (← links)
- Comparison of support-vector machine and sparse representation using a modified rule-based method for automated myocardial ischemia detection (Q306029) (← links)
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Regularity properties of non-negative sparsity sets (Q342902) (← links)
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures (Q361272) (← links)
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458) (← links)
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
- Feature selection when there are many influential features (Q396025) (← links)
- The residual method for regularizing ill-posed problems (Q425458) (← links)
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization (Q427066) (← links)
- Robust face recognition via block sparse Bayesian learning (Q474521) (← links)
- \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers (Q485350) (← links)
- Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization (Q490274) (← links)
- Sparse decomposition by iterating Lipschitzian-type mappings (Q517031) (← links)
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction (Q529940) (← links)
- Identification of switched linear systems via sparse optimization (Q534276) (← links)
- Consistent tuning parameter selection in high dimensional sparse linear regression (Q548648) (← links)
- Some empirical advances in matrix completion (Q548919) (← links)
- The Dantzig selector and sparsity oracle inequalities (Q605023) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Criterion for signal extraction in underdetermined mixtures of bounded support (Q635078) (← links)
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices (Q638800) (← links)
- Transformed \(\ell_1\) regularization for learning sparse deep neural networks (Q2185659) (← links)
- Microlocal Analysis of the Geometric Separation Problem (Q4902774) (← links)
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920) (← links)
- Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
- Gibbs phenomena for L<i><sup>q</sup></i>-best approximation in finite element spaces (Q5034778) (← links)
- On a Scalable Entropic Breaching of the Overfitting Barrier for Small Data Problems in Machine Learning (Q5131158) (← links)
- An unbiased approach to compressed sensing (Q5132273) (← links)
- A Regularized Correntropy Framework for Robust Pattern Recognition (Q5198613) (← links)
- Sparse reconstructions from few noisy data: analysis of hierarchical Bayesian models with generalized gamma hyperpriors (Q5213327) (← links)
- Error Correction for Discrete Tomography (Q6094519) (← links)
- CECM: a continuous empirical cubature method with application to the dimensional hyperreduction of parameterized finite element models (Q6120138) (← links)
- Linear inverse problems with Hessian-Schatten total variation (Q6140828) (← links)
- DRIP: deep regularizers for inverse problems (Q6141552) (← links)
- Compressive phase retrieval: Optimal sample complexity with deep generative priors (Q6141977) (← links)
- Sparse basis pursuit for compliance minimization in the vanishing volume ratio limit (Q6149366) (← links)
- Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery (Q6160613) (← links)
- Inducing sparsity via the horseshoe prior in imaging problems (Q6162735) (← links)
- Eigenmatrix for unstructured sparse recovery (Q6499005) (← links)
