scientific article

Publication date: 18 February 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

condition numbers compressive sensing $\ell_1$-minimization basis pursuit partial random circulant matrix Khintchine inequalities bounded orthogonal systems structured random matrices random partial Fourier matrix

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Convex programming (90C25) Sums of independent random variables; random walks (60G50) Applications of mathematical programming (90C90) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Random matrices (algebraic aspects) (15B52) Sampling theory in information and communication theory (94A20) Trigonometric polynomials, inequalities, extremal problems (42A05) Conditioning of matrices (15A12) Probabilistic methods for one variable harmonic analysis (42A61) Toeplitz, Cauchy, and related matrices (15B05) Orthogonal matrices (15B10)

Related Items (89)

Convergence bounds for empirical nonlinear least-squares ⋮ Refined analysis of sparse MIMO radar ⋮ Sampling discretization and related problems ⋮ Fast sparse reconstruction: Greedy inverse scale space flows ⋮ Improved bounds for sparse recovery from subsampled random convolutions ⋮ On polynomial chaos expansion via gradient-enhanced $\ell_1$-minimization ⋮ Improved sparse Fourier approximation results: Faster implementations and stronger guarantees ⋮ A new upper bound for sampling numbers ⋮ Compressive Sensing with Redundant Dictionaries and Structured Measurements ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ Deterministic convolutional compressed sensing matrices ⋮ Cosparsity in Compressed Sensing ⋮ Sparse signal recovery via non-convex optimization and overcomplete dictionaries ⋮ Compressive Imaging and Characterization of Sparse Light Deflection Maps ⋮ Extracting Sparse High-Dimensional Dynamics from Limited Data ⋮ Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies ⋮ Low rank tensor recovery via iterative hard thresholding ⋮ Generalized notions of sparsity and restricted isometry property. II: Applications ⋮ Gradient projection Newton pursuit for sparsity constrained optimization ⋮ Sparsest representations and approximations of an underdetermined linear system ⋮ The restricted isometry property for time-frequency structured random matrices ⋮ The Gelfand widths of $\ell_p$-balls for $0 < p \leq 1$ ⋮ The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials ⋮ Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class ⋮ Improved bounds for the RIP of Subsampled Circulant matrices ⋮ A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems ⋮ Embracing off-the-grid samples ⋮ Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations ⋮ Remote sensing via $\ell_1$-minimization ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ Restricted isometries for partial random circulant matrices ⋮ Norms of structured random matrices ⋮ Basis adaptive sample efficient polynomial chaos (BASE-PC) ⋮ A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions ⋮ A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry ⋮ Sparse Legendre expansions via $\ell_1$-minimization ⋮ Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation ⋮ Interpolation via weighted $\ell_{1}$ minimization ⋮ Polynomial approximation via compressed sensing of high-dimensional functions on lower sets ⋮ Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures ⋮ Noncommutative Bennett and Rosenthal inequalities ⋮ Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices ⋮ Average best $m$-term approximation ⋮ Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification ⋮ On Linear Versus Nonlinear Approximation in the Average Case Setting ⋮ Compressed sensing with structured sparsity and structured acquisition ⋮ New bounds for RIC in compressed sensing ⋮ Short-Term Memory Capacity in Networks via the Restricted Isometry Property ⋮ The restricted isometry property for random block diagonal matrices ⋮ Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions ⋮ Matrix concentration inequalities via the method of exchangeable pairs ⋮ Sparse recovery on Euclidean Jordan algebras ⋮ Discrete uncertainty principles and sparse signal processing ⋮ Norm and Trace Estimation with Random Rank-one Vectors ⋮ A preconditioning approach for improved estimation of sparse polynomial chaos expansions ⋮ A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness ⋮ Worst-case recovery guarantees for least squares approximation using random samples ⋮ Spark-level sparsity and the $\ell_1$ tail minimization ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ Sparse signal recovery using a new class of random matrices ⋮ Embeddings of operator ideals into $\mathcal{L}_p$-spaces on finite von Neumann algebras ⋮ Total variation reconstruction from quadratic measurements ⋮ Sparse signals recovery from noisy measurements by orthogonal matching pursuit ⋮ Learning general sparse additive models from point queries in high dimensions ⋮ Greedy variance estimation for the LASSO ⋮ Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization ⋮ Moment inequalities for matrix-valued U-statistics of order 2 ⋮ Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis ⋮ Fusion frames and distributed sparsity ⋮ Optimal Compressive Imaging of Fourier Data ⋮ On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm ⋮ Fast and RIP-optimal transforms ⋮ Analysis of sparse MIMO radar ⋮ Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases ⋮ $L_2$-norm sampling discretization and recovery of functions from RKHS with finite trace ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ On the strong restricted isometry property of Bernoulli random matrices ⋮ Sparse reconstruction with multiple Walsh matrices ⋮ Multilevel preconditioning and adaptive sparse solution of inverse problems ⋮ Sparse Representation of Signals in Hardy Space ⋮ Quantized compressed sensing for random circulant matrices ⋮ Fast and memory-optimal dimension reduction using Kac's walk ⋮ Minimization of $\ell_{1-2}$ for Compressed Sensing ⋮ The Restricted Isometry Property of Subsampled Fourier Matrices ⋮ GenMod: a generative modeling approach for spectral representation of PDEs with random inputs ⋮ Sparse recovery of sound fields using measurements from moving microphones ⋮ Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing ⋮ New analysis of manifold embeddings and signal recovery from compressive measurements ⋮ A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

This page was built for publication: