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.
- 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)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\) (Q650241) (← links)
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification (Q650959) (← links)
- Unified approach to coefficient-based regularized regression (Q651513) (← links)
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing (Q695638) (← links)
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness (Q722765) (← links)
- Analysis of basis pursuit via capacity sets (Q734943) (← links)
- Overcomplete blind source separation based on generalized Gaussian function and SL0 norm (Q736930) (← links)
- Image reconstruction for diffuse optical tomography based on radiative transfer equation (Q738275) (← links)
- Rational sphere maps, linear programming, and compressed sensing (Q830389) (← links)
- Minimizers of sparsity regularized Huber loss function (Q831370) (← links)
- High-dimensional variable selection (Q834336) (← links)
- Sparsity in penalized empirical risk minimization (Q838303) (← links)
- Random sampling of sparse trigonometric polynomials (Q861807) (← links)
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint (Q869974) (← links)
- A selective overview of feature screening for ultrahigh-dimensional data (Q892795) (← links)
- Geometric separation of singularities using combined multiscale dictionaries (Q895421) (← links)
- Non-negative and sparse spectral clustering (Q898301) (← links)
- Image reconstruction from Fourier data using sparsity of edges (Q898494) (← links)
- Domain adaptation for face recognition: targetize source domain bridged by common subspace (Q903546) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Consistencies and rates of convergence of jump-penalized least squares estimators (Q1002154) (← links)
