Domain decomposition methods for linear inverse problems with sparsity constraints
type: Item
instance of: scholarly article
title: Domain decomposition methods for linear inverse problems with sparsity constraints
zbMATH Open document ID: 1131.65042
DOI: 10.1088/0266-5611/23/6/014
author: Massimo Fornasier
published in: Inverse Problems
publication date: 2008-01-03T00:00:00Z
Mathematics Subject Classification ID: 65J10
Mathematics Subject Classification ID: 65J22
Mathematics Subject Classification ID: 47A50
zbMATH DE Number: 5222976
zbMATH Keywords: Landweber algorithms
MaRDI profile type: Publication
OpenAlex ID: W2134123171
Recommended article: Overlapping domain decomposition methods for linear inverse problems
Recommended article: Q3975663
Recommended article: Sparsity regularization in inverse problems
Recommended article: Q3078295
Recommended article: Q3086121
Recommended article: Sparsity and Compressed Sensing in Inverse Problems
Recommended article: Linear approximation method for solving split inverse problems and its applications
Recommended article: Q2991708
Recommended article: An efficient projection method for nonlinear inverse problems with sparsity constraints
Recommended article: Alternating Direction Method of Multipliers for Linear Inverse Problems
description: scientific article; zbMATH DE number 5222976