Compressive sensing and structured random matrices
From MaRDI portal
(Redirected from Publication:3078293)
compressive sensingcondition numbers\(\ell_1\)-minimizationbasis pursuitpartial random circulant matrixKhintchine inequalitiesbounded orthogonal systemsstructured random matricesrandom partial Fourier matrix
Convex programming (90C25) Linear programming (90C05) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Sums of independent random variables; random walks (60G50) Conditioning of matrices (15A12) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Toeplitz, Cauchy, and related matrices (15B05) Orthogonal matrices (15B10) Trigonometric polynomials, inequalities, extremal problems (42A05) Sampling theory in information and communication theory (94A20) Probabilistic methods for one variable harmonic analysis (42A61)
Recommendations
Cited in
(only showing first 100 items - show all)- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Sampling, denoising and compression of matrices by coherent matrix organization
- On log-concave-tailed chaoses and the restricted isometry property
- Linear convergence of reshuffling Kaczmarz methods with sparse constraints
- On the strong restricted isometry property of Bernoulli random matrices
- Fast and memory-optimal dimension reduction using Kac's walk
- Total variation reconstruction from quadratic measurements
- Multilevel preconditioning and adaptive sparse solution of inverse problems
- Sparse approximation using _1-_2 minimization and its application to stochastic collocation
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- Norms of structured random matrices
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Fusion frames and distributed sparsity
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs
- A mathematical introduction to compressive sensing
- Remote sensing via _1-minimization
- Structured random measurements in signal processing
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Sparse Legendre expansions via _1-minimization
- Sparse recovery of sound fields using measurements from moving microphones
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
- Gradient projection Newton pursuit for sparsity constrained optimization
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- On linear versus nonlinear approximation in the average case setting
- Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Fast sparse reconstruction: Greedy inverse scale space flows
- Short-term memory capacity in networks via the restricted isometry property
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Sparsest representations and approximations of an underdetermined linear system
- New analysis of manifold embeddings and signal recovery from compressive measurements
- scientific article; zbMATH DE number 6497011 (Why is no real title available?)
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Greedy variance estimation for the LASSO
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Spark-level sparsity and the _1 tail minimization
- Generalized notions of sparsity and restricted isometry property. II: Applications
- Fast and RIP-optimal transforms
- Derandomized compressed sensing with nonuniform guarantees for _1 recovery
- Embracing off-the-grid samples
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Average best \(m\)-term approximation
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
- Sparse system identification in pairs of pulse and Takenaka-Malmquist bases
- Binary Matrices for Compressed Sensing
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions
- Analysis of sparse MIMO radar
- Kronecker-product random matrices and a matrix least squares problem
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Quantized compressed sensing for random circulant matrices
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- Improved bounds for the RIP of subsampled circulant matrices
- New bounds for RIC in compressed sensing
- Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
- Deterministic convolutional compressed sensing matrices
- Low rank tensor recovery via iterative hard thresholding
- Restricted isometries for partial random circulant matrices
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- A short introduction to compressive sensing
- The restricted isometry property for random block diagonal matrices
- Sparse recovery on Euclidean Jordan algebras
- Sparse reconstruction with multiple Walsh matrices
- Cosparsity in Compressed Sensing
- Convergence bounds for empirical nonlinear least-squares
- Extracting Sparse High-Dimensional Dynamics from Limited Data
- Matrix concentration inequalities via the method of exchangeable pairs
- Interpolation via weighted \(\ell_{1}\) minimization
- Efficient sensitivity analysis in biomanufacturing with sequential Shapley value estimation
- Least squares polynomial chaos expansion: a review of sampling strategies
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Compressive Spectral Estimation for Nonstationary Random Processes
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Moment inequalities for matrix-valued U-statistics of order 2
- Norm and trace estimation with random rank-one vectors
- A new upper bound for sampling numbers
- Learning general sparse additive models from point queries in high dimensions
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- Analysis of sparse recovery for Legendre expansions using envelope bound
- Embeddings of operator ideals into \(\mathcal{L}_p\)-spaces on finite von Neumann algebras
- Worst-case recovery guarantees for least squares approximation using random samples
- Optimal compressive imaging of Fourier data
- Compressed sensing with structured sparsity and structured acquisition
- Sampling discretization and related problems
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- Noncommutative Bennett and Rosenthal inequalities
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Refined analysis of sparse MIMO radar
- The restricted isometry property for time-frequency structured random matrices
- Compressing Rank-Structured Matrices via Randomized Sampling
- Improved bounds for sparse recovery from subsampled random convolutions
This page was built for publication: Compressive sensing and structured random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078293)
