Pith. sign in

REVIEW

A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.09831 v1 pith:FMGSEH6W submitted 2022-05-19 math.NA cs.NA

A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration

classification math.NA cs.NA
keywords problemsnonlinearparameterregularizationrulescasechoiceheuristic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The choice of a suitable regularization parameter is an important part of most regularization methods for inverse problems. In the absence of reliable estimates of the noise level, heuristic parameter choice rules can be used to accomplish this task. While they are already fairly well-understood and tested in the case of linear problems, not much is known about their behaviour for nonlinear problems and even less in the respective case of iterative regularization. Hence, in this paper, we numerically study the performance of some of these rules when used to determine a stopping index for Landweber iteration for various nonlinear inverse problems. These are chosen from different practically relevant fields such as integral equations, parameter estimation, and tomography.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.