Pages that link to "Item:Q5385847"
From MaRDI portal
The following pages link to Neighborliness of randomly projected simplices in high dimensions (Q5385847):
Displaying 50 items.
- Empirical average-case relation between undersampling and sparsity in X-ray CT (Q256004) (← links)
- The remarkable simplicity of very high dimensional data: application of model-based clustering (Q263091) (← links)
- Sharp MSE bounds for proximal denoising (Q330102) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization (Q391843) (← links)
- Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
- The restricted isometry property for random block diagonal matrices (Q466970) (← links)
- System identification in the presence of outliers and random noises: a compressed sensing approach (Q473320) (← 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)
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization (Q664941) (← links)
- Random sampling of sparse trigonometric polynomials (Q861807) (← links)
- Random projections of smooth manifolds (Q1029551) (← links)
- Symmetry in data mining and analysis: a unifying view based on hierarchy (Q1048428) (← links)
- Gaussian polytopes: a cumulant-based approach (Q1635836) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- A Rice method proof of the null-space property over the Grassmannian (Q1700392) (← links)
- Recovery of signals under the condition on RIC and ROC via prior support information (Q1713645) (← links)
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions (Q1986404) (← links)
- Overcoming the limitations of phase transition by higher order analysis of regularization techniques (Q1991696) (← links)
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem (Q1993073) (← links)
- A simple and feasible method for a class of large-scale \(l^1\)-problems (Q2006233) (← links)
- Random Gale diagrams and neighborly polytopes in high dimensions (Q2042129) (← links)
- The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning (Q2054498) (← links)
- Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks (Q2099818) (← links)
- Analysis of sparse recovery algorithms via the replica method (Q2106475) (← links)
- Convex cones spanned by regular polytopes (Q2127863) (← links)
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery (Q2155809) (← links)
- A numerical exploration of compressed sampling recovery (Q2267399) (← links)
- Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data (Q2271331) (← links)
- Universality in polytope phase transitions and message passing algorithms (Q2341631) (← links)
- Counting the faces of randomly-projected hypercubes and orthants, with applications (Q2380787) (← links)
- The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes (Q2694729) (← links)
- Compressive Sensing (Q2789803) (← links)
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization (Q2815509) (← links)
- Theory and applications of compressed sensing (Q2864809) (← links)
- Performance comparisons of greedy algorithms in compressed sensing (Q2948099) (← links)
- Phase transitions in semidefinite relaxations (Q2962328) (← links)
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING (Q2971048) (← links)
- Linearized Bregman iterations for compressed sensing (Q3055156) (← links)
- Counting faces of randomly projected polytopes when the projection radically lowers dimension (Q3079190) (← links)
- Statistical mechanics of complex neural systems and high dimensional data (Q3301560) (← links)
- Guarantees of total variation minimization for signal recovery (Q4603592) (← links)
- An ℓ<sub>q</sub>- Seminorm Variational Model for Impulse Noise Reduction (Q4985227) (← links)
- Face numbers of high-dimensional Poisson zero cells (Q5049340) (← links)
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials (Q5160076) (← links)
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices (Q5170951) (← links)
- The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising (Q5170964) (← links)
- Sparse recovery from extreme eigenvalues deviation inequalities (Q5228345) (← links)
- Sparse nonnegative solution of underdetermined linear equations by linear programming (Q5385846) (← links)
