Pages that link to "Item:Q633105"
From MaRDI portal
The following pages link to On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105):
Displaying 35 items.
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions (Q349012) (← links)
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458) (← links)
- \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
- Sparse recovery on Euclidean Jordan algebras (Q471921) (← links)
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- The sparsest solutions to \(Z\)-tensor complementarity problems (Q519760) (← links)
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
- Testing the nullspace property using semidefinite programming (Q633104) (← links)
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions (Q633107) (← links)
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization (Q664941) (← links)
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals (Q741817) (← links)
- Self-concordant analysis for logistic regression (Q1952060) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Finite-sample analysis of \(M\)-estimators using self-concordance (Q2219231) (← links)
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices (Q2251220) (← links)
- A numerical exploration of compressed sampling recovery (Q2267399) (← links)
- The sparsest solution to the system of absolute value equations (Q2356345) (← links)
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization (Q2375016) (← links)
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices (Q2437333) (← links)
- RIPless compressed sensing from anisotropic measurements (Q2437334) (← links)
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures (Q2437335) (← links)
- Partial \(S\)-goodness for partially sparse signal recovery (Q2438325) (← links)
- Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors (Q2443203) (← links)
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? (Q2659754) (← links)
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization (Q2989298) (← links)
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines (Q3119537) (← links)
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy (Q4579383) (← links)
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems (Q5077161) (← links)
- Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
- Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming (Q6173941) (← links)
