Pages that link to "Item:Q5385846"
From MaRDI portal
The following pages link to Sparse nonnegative solution of underdetermined linear equations by linear programming (Q5385846):
Displaying 50 items.
- Empirical average-case relation between undersampling and sparsity in X-ray CT (Q256004) (← links)
- The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Clustering and feature selection using sparse principal component analysis (Q374668) (← links)
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions (Q384215) (← links)
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization (Q391843) (← links)
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
- High-dimensional covariance matrix estimation with missing observations (Q395991) (← links)
- Exact reconstruction using Beurling minimal extrapolation (Q441986) (← links)
- UPS delivers optimal phase diagram in high-dimensional variable selection (Q450021) (← links)
- The restricted isometry property for random block diagonal matrices (Q466970) (← links)
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- Finding complex balanced and detailed balanced realizations of chemical reaction networks (Q543518) (← links)
- A semidefinite programming study of the Elfving theorem (Q546096) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Testing the nullspace property using semidefinite programming (Q633104) (← links)
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions (Q633107) (← links)
- Null space conditions and thresholds for rank minimization (Q633114) (← links)
- Fast computation of minimal elementary decompositions of metabolic flux vectors (Q665165) (← links)
- On support sizes of restricted isometry constants (Q711053) (← links)
- Three novel edge detection methods for incomplete and noisy spectral data (Q734948) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
- Exact recovery of Dirac ensembles from the projection onto spaces of spherical harmonics (Q745849) (← links)
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation (Q778434) (← links)
- Computing sparse and dense realizations of reaction kinetic systems (Q848181) (← links)
- Random sampling of sparse trigonometric polynomials (Q861807) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- Gaussian polytopes: a cumulant-based approach (Q1635836) (← links)
- PROMP: a sparse recovery approach to lattice-valued signals (Q1669069) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization (Q1688516) (← links)
- Sparse support recovery using correlation information in the presence of additive noise (Q1697954) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (Q1929588) (← links)
- Overcoming the limitations of phase transition by higher order analysis of regularization techniques (Q1991696) (← links)
- Analysis of the self projected matching pursuit algorithm (Q2005321) (← links)
- Lagrangian duality and saddle points for sparse linear programming (Q2010427) (← links)
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks (Q2014813) (← links)
- Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks (Q2099818) (← links)
- LASSO risk and phase transition under dependence (Q2106809) (← links)
- On non-negative solutions to large systems of random linear equations (Q2141437) (← links)
- Sparse signal recovery via generalized Gaussian function (Q2154451) (← links)
- Real-valued group testing for quantitative molecular assays (Q2170137) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- Which bridge estimator is the best for variable selection? (Q2215760) (← links)
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement (Q2251573) (← links)
- A new sparse recovery method for the inverse acoustic scattering problem (Q2300540) (← links)
- Critical behavior and universality classes for an algorithmic phase transition in sparse reconstruction (Q2316055) (← links)
- Universality in polytope phase transitions and message passing algorithms (Q2341631) (← links)
