Pages that link to "Item:Q2498932"

The following pages link to High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension (Q2498932):

Displaying 50 items.

• Computing and analyzing recoverable supports for sparse reconstruction (Q269197) (← links)
• Sharp MSE bounds for proximal denoising (Q330102) (← links)
• The essential ability of sparse reconstruction of different compressive sensing strategies (Q362190) (← links)
• Sparse SAR imaging based on \(L_{1/2}\) regularization (Q362313) (← links)
• Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain (Q362320) (← links)
• Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
• System identification in the presence of outliers and random noises: a compressed sensing approach (Q473320) (← links)
• A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization (Q477827) (← links)
• Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
• Null space conditions and thresholds for rank minimization (Q633114) (← links)
• Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling (Q634656) (← links)
• On support sizes of restricted isometry constants (Q711053) (← links)
• From Steiner formulas for cones to concentration of intrinsic volumes (Q741611) (← links)
• GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
• Random projections of smooth manifolds (Q1029551) (← links)
• Expander \(\ell_0\)-decoding (Q1669068) (← links)
• A Rice method proof of the null-space property over the Grassmannian (Q1700392) (← links)
• Spark-level sparsity and the \(\ell_1\) tail minimization (Q1748258) (← links)
• The convex geometry of linear inverse problems (Q1928276) (← 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)
• 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)
• The restricted isometry property of block diagonal matrices for group-sparse signal recovery (Q2155809) (← links)
• A numerical exploration of compressed sampling recovery (Q2267399) (← 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)
• Consistency of \(\ell_1\) recovery from noisy deterministic measurements (Q2450946) (← links)
• A centrally symmetric version of the cyclic polytope (Q2482204) (← links)
• Compressive Sensing (Q2789803) (← links)
• PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ₁ LINEAR PROGRAMMING (Q2868199) (← links)
• Performance comparisons of greedy algorithms in compressed sensing (Q2948099) (← links)
• Counting faces of randomly projected polytopes when the projection radically lowers dimension (Q3079190) (← links)
• From Acute Sets to Centrally Symmetric 2-Neighborly Polytopes (Q3174697) (← links)
• Typical<i>l</i>₁-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices (Q3301307) (← links)
• Regularization Strategies for Contiguous and Noncontiguous Damage Detection of Structures (Q3383881) (← links)
• Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing (Q3460831) (← 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)
• Guarantees of total variation minimization for signal recovery (Q4603592) (← links)
• Face numbers of high-dimensional Poisson zero cells (Q5049340) (← links)
• Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control (Q5152596) (← links)
• Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices (Q5170951) (← links)
• Linear Positive Systems May Have a Reachable Subset from the Origin That is Either Polyhedral or Nonpolyhedral (Q5222095) (← links)
• Consistent parameter estimation for Lasso and approximate message passing (Q5916043) (← links)
• Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit (Q6046301) (← links)
• (Q6073213) (← links)
• Monotone paths on cross-polytopes (Q6142345) (← links)
• A reduced half thresholding algorithm (Q6164988) (← links)