Domain decomposition methods for linear inverse problems with sparsity constraints
From MaRDI portal
Recommendations
- Overlapping domain decomposition methods for linear inverse problems
- scientific article; zbMATH DE number 18294
- Sparsity regularization in inverse problems
- Sparse recovery in inverse problems
- Inverse problems with sparsity constraints: Convergence rates and exact recovery
- Sparsity and compressed sensing in inverse problems
- Linear approximation method for solving split inverse problems and its applications
- A kind of ill-posed inverse problem solving with sparsity constraint
- An efficient projection method for nonlinear inverse problems with sparsity constraints
- Alternating direction method of multipliers for linear inverse problems
Cited in
(23)- Bregmanized domain decomposition for image restoration
- Sparsity of solutions for variational inverse problems with finite-dimensional data
- A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations
- Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
- The stochastic properties of \(\ell^1\)-regularized spherical Gaussian fields
- A parallel line search subspace correction method for composite convex optimization
- Block decomposition methods for total variation by primal-dual stitching
- A nonlinear PDE-based method for sparse deconvolution
- Proximal splitting methods in signal processing
- An efficient projection method for nonlinear inverse problems with sparsity constraints
- Sparse regularization of inverse problems by operator-adapted frame thresholding
- Relax-and-split method for nonconvex inverse problems
- Overlapping domain decomposition methods for total variation denoising
- Dual-primal domain decomposition methods for the total variation minimization
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Dualization of signal recovery problems
- An iterative thresholding algorithm for linear inverse problems with multi-constraints and its applications
- Domain decomposition for non-smooth (in particular TV) minimization
- Subspace methods for nonlinear optimization
- A convergent overlapping domain decomposition method for total variation minimization
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- Non-convex sparse regularisation
- Multi-frame representations in linear inverse problems with mixed multi-constraints
This page was built for publication: Domain decomposition methods for linear inverse problems with sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434140)
