Domain decomposition methods for linear inverse problems with sparsity constraints
From MaRDI portal
Publication:5434140
DOI10.1088/0266-5611/23/6/014zbMath1131.65042OpenAlexW2134123171MaRDI QIDQ5434140
Publication date: 3 January 2008
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0b67e860187e3e83fe75d4b5fdaef4072e9bf58a
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items (15)
Dual-Primal Domain Decomposition Methods for the Total Variation Minimization ⋮ Proximal Splitting Methods in Signal Processing ⋮ Block decomposition methods for total variation by primal-dual stitching ⋮ Non-convex sparse regularisation ⋮ An efficient projection method for nonlinear inverse problems with sparsity constraints ⋮ Dualization of signal recovery problems ⋮ Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term ⋮ Bregmanized domain decomposition for image restoration ⋮ Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition ⋮ A convergent overlapping domain decomposition method for total variation minimization ⋮ The stochastic properties of \(\ell^1\)-regularized spherical Gaussian fields ⋮ Accelerated projected gradient method for linear inverse problems with sparsity constraints ⋮ A parallel line search subspace correction method for composite convex optimization ⋮ A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations ⋮ Overlapping Domain Decomposition Methods for Total Variation Denoising
This page was built for publication: Domain decomposition methods for linear inverse problems with sparsity constraints
