Quasi-linear Compressed Sensing
From MaRDI portal
Publication:5250350
DOI10.1137/130929928zbMath1380.94050arXiv1311.1642MaRDI QIDQ5250350
Massimo Fornasier, Juliane Sigl, Martin Ehler
Publication date: 19 May 2015
Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.1642
greedy algorithm; compressed sensing; restricted isometry property; quasi-linear; iterative thresholding
47J25: Iterative procedures involving nonlinear operators
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- The restricted isometry property for time-frequency structured random matrices
- Restricted isometries for partial random circulant matrices
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Phase transitions for greedy sparse approximation algorithms
- Prospects for asteroseismology
- On performance of greedy algorithms
- Iterative hard thresholding for compressed sensing
- Iterative thresholding algorithms
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A simple proof of the restricted isometry property for random matrices
- Phase retrieval: stability and recovery guarantees
- A Tikhonov-based projection iteration for nonlinear ill-posed problems with sparsity con\-straints
- Finding the minimum of a function
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Sparse Signal Recovery from Quadratic Measurements via Convex Programming
- Signal Reconstruction From the Magnitude of Subspace Components
- Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Compressed Sensing and Redundant Dictionaries
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Matching pursuits with time-frequency dictionaries
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Multilevel Gauss–Newton methods for phase retrieval problems
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
- An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
