High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
From MaRDI portal
Publication:2498932
DOI10.1007/s00454-005-1220-0zbMath1095.52500OpenAlexW2010669260WikidataQ56221730 ScholiaQ56221730MaRDI QIDQ2498932
Publication date: 11 August 2006
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-005-1220-0
Related Items
Computing and analyzing recoverable supports for sparse reconstruction ⋮ Face numbers of high-dimensional Poisson zero cells ⋮ From Acute Sets to Centrally Symmetric 2-Neighborly Polytopes ⋮ Counting the faces of randomly-projected hypercubes and orthants, with applications ⋮ Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing ⋮ Sharp MSE bounds for proximal denoising ⋮ The restricted isometry property of block diagonal matrices for group-sparse signal recovery ⋮ The essential ability of sparse reconstruction of different compressive sensing strategies ⋮ Sparse SAR imaging based on \(L_{1/2}\) regularization ⋮ Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain ⋮ Expander \(\ell_0\)-decoding ⋮ The convex geometry of linear inverse problems ⋮ Performance comparisons of greedy algorithms in compressed sensing ⋮ Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Sparse regression for low-dimensional time-dynamic varying coefficient models with application to air quality data ⋮ Monotone paths on cross-polytopes ⋮ A reduced half thresholding algorithm ⋮ Phase transitions for greedy sparse approximation algorithms ⋮ \(r\)-Lah distribution: properties, limit theorems and an application to compressed sensing ⋮ Quantitative robustness of instance ranking problems ⋮ Facets of high-dimensional Gaussian polytopes ⋮ Face numbers: the upper bound side of the story ⋮ A Rice method proof of the null-space property over the Grassmannian ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Guarantees of total variation minimization for signal recovery ⋮ On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization ⋮ Null space conditions and thresholds for rank minimization ⋮ Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling ⋮ Compressive Sensing ⋮ Unnamed Item ⋮ Consistency of \(\ell_1\) recovery from noisy deterministic measurements ⋮ System identification in the presence of outliers and random noises: a compressed sensing approach ⋮ A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization ⋮ Typicall1-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices ⋮ Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control ⋮ Spark-level sparsity and the \(\ell_1\) tail minimization ⋮ Overcoming the limitations of phase transition by higher order analysis of regularization techniques ⋮ Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem ⋮ Consistent parameter estimation for Lasso and approximate message passing ⋮ A centrally symmetric version of the cyclic polytope ⋮ Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices ⋮ A numerical exploration of compressed sampling recovery ⋮ On support sizes of restricted isometry constants ⋮ From Steiner formulas for cones to concentration of intrinsic volumes ⋮ Counting faces of randomly projected polytopes when the projection radically lowers dimension ⋮ GPU accelerated greedy algorithms for compressed sensing ⋮ Regularization Strategies for Contiguous and Noncontiguous Damage Detection of Structures ⋮ The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning ⋮ Linear Positive Systems May Have a Reachable Subset from the Origin That is Either Polyhedral or Nonpolyhedral ⋮ Random projections of smooth manifolds ⋮ Iteratively reweighted least squares minimization for sparse recovery ⋮ Universality in polytope phase transitions and message passing algorithms ⋮ Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks ⋮ PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ1 LINEAR PROGRAMMING
