A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
From MaRDI portal
(Redirected from Publication:5160076)
Recommendations
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Sparse Recovery via ℓq-Minimization for Polynomial Chaos Expansions
- Gradient-based methods for sparse recovery
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method
- A truncated Newton algorithm for nonconvex sparse recovery
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
- Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
Cites work
- A Generalization of Hermite's Interpolation Formula
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- A mathematical introduction to compressive sensing
- A Probabilistic and RIPless Theory of Compressed Sensing
- Adjoint Sensitivity Analysis for Differential-Algebraic Equations: The Adjoint DAE System and Its Numerical Solution
- An introduction to the adjoint approach to design
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressed plane waves yield a compactly supported multiresolution basis for the Laplace operator
- Compressed Sensing Matrices From Fourier Matrices
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Compressive sensing and structured random matrices
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Decoding by Linear Programming
- Deterministic sampling of sparse trigonometric polynomials
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- High-Resolution Radar via Compressed Sensing
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 92475 (Why is no real title available?)
- scientific article; zbMATH DE number 1219577 (Why is no real title available?)
- scientific article; zbMATH DE number 3068616 (Why is no real title available?)
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Interpolation via weighted \(\ell_{1}\) minimization
- Learning coordinate covariances via gradients
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Neighborliness of randomly projected simplices in high dimensions
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- On sparse interpolation and the design of deterministic interpolation points
- On sparse reconstruction from Fourier and Gaussian measurements
- On Sparse Representations in Arbitrary Redundant Bases
- On the _1-norm invariant convex k-sparse decomposition of signals
- On the Compressive Spectral Method
- On the conditioning of random subdictionaries
- One-bit compressed sensing by greedy algorithms
- Orthogonal bases for polynomial regression with derivative information in uncertainty quantification
- PDEs with compressed solutions
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Random sampling of sparse trigonometric polynomials
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse representations in unions of bases
- Sparsity in time-frequency representations
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Stable signal recovery from incomplete and inaccurate measurements
- Stochastic collocation on unstructured multivariate meshes
- The estimation of functional uncertainty using polynomial chaos and adjoint equations
- Uncertainty principles and ideal atomic decomposition
Cited in
(6)- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
- Constructing least-squares polynomial approximations
This page was built for publication: A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160076)
