Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Landweber iteration

The Landweber iteration or Landweber algorithm is an algorithm to solve ill-posed linear inverse problems, and it has been extended to solve non… Expand
Wikipedia

Related topics

Related topics

13 relations
Adjoint state methodComputer visionConvex functionConvex set
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
WSN Multilateration algorithm based on landweber iteration
Node localization plays a critical role in wireless sensor networks(WSN). The ill-posed problem caused by measurement error in… Expand
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Motivic Landweber Exactness
We prove a motivic Landweber exact functor theorem. The main result shows the assignment given by a Landweber-type formula… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Restoration of Chopped and Nodded Images by Framelets
In infrared astronomy, an observed image from a chop-and-nod process can be considered as the result of passing the original… Expand
  • table 5.1
  • table 5.2
  • table 5.4
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Preconditioning Landweber iteration in Hilbert scales
In this paper we investigate convergence of Landweber iteration in Hilbert scales for linear and nonlinear inverse problems. As… Expand
  • table 1
  • table 3
  • table 2
  • table 4
  • table 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A unified treatment of some iterative algorithms in signal processing and image reconstruction
Let T be a (possibly nonlinear) continuous operator on Hilbert space . If, for some starting vector x, the orbit sequence {Tkx,k… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary preassigned… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Iterative oblique projection onto convex sets and the split feasibility problem
Let C and Q be nonempty closed convex sets in R N and R M , respectively, and A an M by N real matrix. The split feasibility… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
On Landweber iteration for nonlinear ill-posed problems in Hilbert scales
Summary. In this paper we derive convergence rates results for Landweber iteration in Hilbert scales in terms of the iteration… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Projected Landweber method and preconditioning
The projected Landweber method is an iterative method for solving constrained least-squares problems when the constraints are… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1989
1989
Parallel algorithms for initial-value problems for difference and differential equations
Abstract Let {yn} be a trajectory defined sequentially by a nonlinear vector difference equation yn+1 = Fn+1(yn) with y0 known. A… Expand
  • table 1
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE