General decomposition pursuit algorithm for linear inverse problems
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- A new computational method for the sparsest solutions to systems of linear equations
- Alternating direction method of multipliers for machine learning
- Atomic Decomposition by Basis Pursuit
- Cardinality minimization, constraints, and regularization: a survey
- Compressed sensing with applications in wireless networks
- Computational methods for large-scale inverse problems: a survey on hybrid projection methods
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Distributed Aggregative Optimization Over Multi-Agent Networks
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dynamic thresholding algorithm with memory for linear inverse problems
- Eigenvalue-free iterative shrinkage-thresholding algorithm for solving the linear inverse problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Generalized Orthogonal Matching Pursuit
- Hard thresholding pursuit: an algorithm for compressive sensing
- Heavy-ball enhanced pseudo-inverse-based hard thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Inverse problems. Basics, theory and applications in geophysics
- Iterative hard thresholding for low-rank recovery from rank-one projections
- Iterative thresholding for sparse approximations
- Learning to optimize: a tutorial for continuous and mixed-integer optimization
- Linear inverse problems
- Matching pursuits with time-frequency dictionaries
- Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
- On alternating direction methods of multipliers: a historical perspective
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Outlier detection using generative models with theoretical performance guarantees
- Relaxed regularization for linear inverse problems
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Robust information criterion for model selection in sparse high-dimensional linear regression models
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- Sparse optimization theory and methods
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse Solutions of Underdetermined Linear Systems and Their Applications
- Splitting Methods in Communication, Imaging, Science, and Engineering
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
- Uncertainty principles and ideal atomic decomposition
- Weak greedy algorithms
This page was built for publication: General decomposition pursuit algorithm for linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7256051)
