A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
From MaRDI portal
Publication:5160076
DOI10.4208/cicp.OA-2018-0006MaRDI QIDQ5160076
No author found.
Publication date: 28 October 2021
Published in: Communications in Computational Physics (Search for Journal in Brave)
compressed sensingrestricted isometry propertymutual incoherencegradient-enhanced \(\ell_1\) minimizationsparse Fourier expansions
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20) Computational methods for problems pertaining to information and communication theory (94-08)
Related Items (3)
The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials ⋮ A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions ⋮ Constructing Least-Squares Polynomial Approximations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- A mathematical introduction to compressive sensing
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals
- Random sampling of sparse trigonometric polynomials
- PDEs with compressed solutions
- Interpolation via weighted \(\ell_{1}\) minimization
- On the conditioning of random subdictionaries
- Sparsity in time-frequency representations
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Deterministic sampling of sparse trigonometric polynomials
- Compressed plane waves yield a compactly supported multiresolution basis for the Laplace operator
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- Compressed Sensing Matrices From Fourier Matrices
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- The estimation of functional uncertainty using polynomial chaos and adjoint equations
- A Generalization of Hermite's Interpolation Formula
- On sparse reconstruction from Fourier and Gaussian measurements
- On Sparse Representations in Arbitrary Redundant Bases
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Adjoint Sensitivity Analysis for Differential-Algebraic Equations: The Adjoint DAE System and Its Numerical Solution
- Uncertainty principles and ideal atomic decomposition
- High-Resolution Radar via Compressed Sensing
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- On the Compressive Spectral Method
- A Probabilistic and RIPless Theory of Compressed Sensing
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
- Stable Recovery of Sparse Signals and an Oracle Inequality
- One-Bit Compressed Sensing by Greedy Algorithms
- Stochastic Collocation on Unstructured Multivariate Meshes
- Neighborliness of randomly projected simplices in high dimensions
- ORTHOGONAL BASES FOR POLYNOMIAL REGRESSION WITH DERIVATIVE INFORMATION IN UNCERTAINTY QUANTIFICATION
- Stable signal recovery from incomplete and inaccurate measurements
- An introduction to the adjoint approach to design
This page was built for publication: A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
