An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography
From MaRDI portal
Publication:1946625
DOI10.1007/s10589-012-9482-yzbMath1269.90079arXiv1202.3362MaRDI QIDQ1946625
Caroline Verhoeven, Ignace Loris
Publication date: 15 April 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3362
wavelets; iterative algorithm; convex optimization; inverse problems; sparsity; magneto-encephalography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A unified primal-dual algorithm framework based on Bregman iteration
- Adaptive iterative thresholding algorithms for magnetoencephalography (MEG)
- Nonorthogonal multiresolution analyses, commutation between projectors and differentiation and divergence-free vector wavelets
- The ``cubed sphere: A new method for the solution of partial differential equations in spherical geometry
- Proximal Splitting Methods in Signal Processing
- Divergence-free wavelet bases on the hypercube: Free-slip boundary conditions, and applications for solving the instationary Stokes equations
- Sparse and stable Markowitz portfolios
- A Modified TV-Stokes Model for Image Processing
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- An alternating extragradient method for total variation-based image restoration from Poisson data
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Ten Lectures on Wavelets
- Biorthogonal bases of compactly supported wavelets
- Atomic Decomposition by Basis Pursuit
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
