Pages that link to "Item:Q3079190"
From MaRDI portal
The following pages link to Counting faces of randomly projected polytopes when the projection radically lowers dimension (Q3079190):
Displaying 50 items.
- SLOPE is adaptive to unknown sparsity and asymptotically minimax (Q292875) (← links)
- Deterministic convolutional compressed sensing matrices (Q324274) (← links)
- The restricted isometry property for time-frequency structured random matrices (Q365713) (← links)
- Centrally symmetric polytopes with many faces (Q375863) (← links)
- Simple bounds for recovering low-complexity models (Q378116) (← links)
- Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- On the geometry of random convex sets between polytopes and zonotopes (Q511276) (← links)
- Generalized sampling and infinite-dimensional compressed sensing (Q515987) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling (Q634656) (← links)
- Graphs, skeleta and reconstruction of polytopes (Q722351) (← links)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization (Q734955) (← links)
- Hard thresholding pursuit algorithms: number of iterations (Q739467) (← links)
- Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems (Q848925) (← links)
- Sparse disjointed recovery from noninflating measurements (Q890475) (← links)
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements (Q904283) (← links)
- On the conditioning of random subdictionaries (Q930731) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
- Random projections of smooth manifolds (Q1029551) (← links)
- Improved bounds for sparse recovery from subsampled random convolutions (Q1634177) (← links)
- Gaussian polytopes: a cumulant-based approach (Q1635836) (← links)
- Compressed sensing of data with a known distribution (Q1669057) (← links)
- A Rice method proof of the null-space property over the Grassmannian (Q1700392) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- An algebraic perspective on integer sparse recovery (Q2007643) (← links)
- Random Gale diagrams and neighborly polytopes in high dimensions (Q2042129) (← 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)
- Threshold phenomena for random cones (Q2117356) (← links)
- Convex cones spanned by regular polytopes (Q2127863) (← links)
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery (Q2155809) (← links)
- Sparse reconstruction with multiple Walsh matrices (Q2317908) (← 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)
- Compressed sensing for finite-valued signals (Q2401311) (← links)
- Intrinsic volumes of polyhedral cones: a combinatorial perspective (Q2408212) (← links)
- Greedy-like algorithms for the cosparse analysis model (Q2437331) (← links)
- A centrally symmetric version of the cyclic polytope (Q2482204) (← links)
- Compressive Sensing (Q2789803) (← links)
- Estimation in High Dimensions: A Geometric Perspective (Q2799917) (← links)
- Performance comparisons of greedy algorithms in compressed sensing (Q2948099) (← links)
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING (Q2971048) (← links)
- Monotonicity of expected 𝑓-vectors for projections of regular polytopes (Q3130851) (← links)
- Book Review: A mathematical introduction to compressive sensing (Q3178754) (← links)
- Typical<i>l</i><sub>1</sub>-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices (Q3301307) (← links)
- Iteratively reweighted least squares minimization for sparse recovery (Q3655588) (← links)
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion (Q4603591) (← links)
- Flavors of Compressive Sensing (Q4609797) (← links)
