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 50 items.
- Lasso-type recovery of sparse representations for high-dimensional data (Q1002157) (← links)
- Sparse recovery in convex hulls via entropy penalization (Q1018643) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- Random projections of smooth manifolds (Q1029551) (← links)
- On a simple derivation of the complementary matching pursuit (Q1048880) (← links)
- Computation of sparse and dense equilibrium strategies of evolutionary games (Q1630457) (← links)
- Data shared Lasso: a novel tool to discover uplift (Q1659082) (← links)
- Noise-robust semi-supervised learning via fast sparse coding (Q1677083) (← links)
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) (← links)
- Geometric separation in \(\mathbb{R}^3\) (Q1710654) (← links)
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing (Q1724067) (← links)
- An overview on the applications of matrix theory in wireless communications and signal processing (Q1736835) (← links)
- Blind identification of fully observed linear time-varying systems via sparse recovery (Q1737658) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- A domain decomposition Fourier continuation method for enhanced \(L_1\) regularization using sparsity of edges in reconstructing Fourier data (Q1742671) (← links)
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all (Q1748256) (← links)
- A probabilistic learning algorithm for robust modeling using neural networks with random weights (Q1749195) (← links)
- Dictionary evaluation and optimization for sparse coding based speech processing (Q1749610) (← links)
- The noncooperative transportation problem and linear generalized Nash games (Q1754116) (← links)
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition (Q1785395) (← links)
- Augmented sparse reconstruction of protein signaling networks (Q1798095) (← links)
- Efficient dictionary learning with sparseness-enforcing projections (Q1799978) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- Compressed sensing and matrix completion with constant proportion of corruptions (Q1939501) (← links)
- Discussion: Latent variable graphical model selection via convex optimization (Q1940763) (← links)
- Rejoinder: Latent variable graphical model selection via convex optimization (Q1940764) (← links)
- On discrete \(\ell ^{1}\)-regularization (Q1946524) (← links)
- The Lasso problem and uniqueness (Q1951165) (← links)
- New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications (Q1952757) (← links)
- Compressed sensing of color images (Q1957911) (← links)
- Reconstructed error and linear representation coefficients restricted by \(\ell_1\)-minimization for face recognition under different illumination and occlusion (Q1992344) (← links)
- The generalized Lasso problem and uniqueness (Q2002568) (← links)
- A novel robust principal component analysis algorithm of nonconvex rank approximation (Q2004251) (← links)
- Signal recovery by discrete approximation and a Prony-like method (Q2012599) (← links)
- Complexity and applications of the homotopy principle for uniformly constrained sparse minimization (Q2019907) (← links)
- An optimization problem arising in CR geometry (Q2039742) (← links)
- A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
- Sampling from non-smooth distributions through Langevin diffusion (Q2065460) (← links)
- Robust sparse recovery via a novel convex model (Q2079105) (← links)
- Information criteria bias correction for group selection (Q2093122) (← links)
- Atmospheric radar imaging improvements using compressed sensing and MIMO (Q2106492) (← links)
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss (Q2129205) (← links)
- Stable high-order cubature formulas for experimental data (Q2133503) (← links)
- Binomiality testing and computing sparse polynomials via witness sets (Q2155632) (← links)
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems (Q2168919) (← links)
- How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning (Q2170515) (← links)
- Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization (Q2179083) (← links)
- Transformed \(\ell_1\) regularization for learning sparse deep neural networks (Q2185659) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
