Pages that link to "Item:Q351503"
From MaRDI portal
The following pages link to A mathematical introduction to compressive sensing (Q351503):
Displaying 50 items.
- Empirical average-case relation between undersampling and sparsity in X-ray CT (Q256004) (← links)
- Computing and analyzing recoverable supports for sparse reconstruction (Q269197) (← links)
- On tensor product approximation of analytic functions (Q281571) (← links)
- A geometrical stability condition for compressed sensing (Q286166) (← links)
- Gaussian approximations in high dimensional estimation (Q286514) (← links)
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Phase retrieval from Gabor measurements (Q301574) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Hellmann-Feynman connection for the relative Fisher information (Q305353) (← links)
- Carl's inequality for quasi-Banach spaces (Q306568) (← links)
- A unified framework for linear dimensionality reduction in L1 (Q310869) (← links)
- Sparse solutions of linear complementarity problems (Q312696) (← links)
- Conjugate gradient acceleration of iteratively re-weighted least squares methods (Q316180) (← links)
- A class of deterministic sensing matrices and their application in harmonic detection (Q318592) (← links)
- Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
- Deterministic bounds for restricted isometry in compressed sensing matrices (Q334406) (← links)
- On maximal relative projection constants (Q335420) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory (Q341409) (← links)
- Regularity properties of non-negative sparsity sets (Q342902) (← links)
- Complexity of linear ill-posed problems in Hilbert space (Q346297) (← links)
- Improved recovery guarantees for phase retrieval from coded diffraction patterns (Q347510) (← links)
- Low rank matrix recovery from rank one measurements (Q347516) (← links)
- Robust sparse phase retrieval made easy (Q347523) (← links)
- Average best \(m\)-term approximation (Q443892) (← links)
- Near-optimal encoding for sigma-delta quantization of finite frame expansions (Q485203) (← links)
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing (Q492558) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- On uniqueness guarantees of solution in convex regularized linear inverse problems (Q498340) (← links)
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations (Q506609) (← links)
- Orthogonal matching pursuit under the restricted isometry property (Q515909) (← links)
- Generalized sampling and infinite-dimensional compressed sensing (Q515987) (← links)
- Dimensionality reduction with subgaussian matrices: a unified theory (Q515989) (← links)
- Sparse recovery under weak moment assumptions (Q520739) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
- Compressed sensing for quaternionic signals (Q523053) (← links)
- Low-rank matrix recovery via rank one tight frame measurements (Q666654) (← links)
- Discrete uncertainty principles and sparse signal processing (Q667658) (← links)
- A new generalized shrinkage conjugate gradient method for sparse recovery (Q667880) (← links)
- Noise folding in completely perturbed compressed sensing (Q670261) (← links)
- Nonlinear frames and sparse reconstructions in Banach spaces (Q682869) (← links)
- Solution of linear ill-posed problems using random dictionaries (Q721620) (← links)
- Covering compact metric spaces greedily (Q722361) (← links)
- Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods (Q722763) (← links)
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness (Q722765) (← links)
- Uniform recovery of fusion frame structured sparse signals (Q739459) (← links)
- Hard thresholding pursuit algorithms: number of iterations (Q739467) (← links)
- Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
- Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control (Q781560) (← links)
