Iteration methods for convexly constrained ill-posed problems in hilbert space (Q4029153)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iteration methods for convexly constrained ill-posed problems in hilbert space |
scientific article; zbMATH DE number 126471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iteration methods for convexly constrained ill-posed problems in hilbert space |
scientific article; zbMATH DE number 126471 |
Statements
Iteration methods for convexly constrained ill-posed problems in hilbert space (English)
0 references
7 March 1993
0 references
ill-posed problem
0 references
convex constraints
0 references
solution of minimal norm
0 references
Tikhonov-Phillips iterative regularization method
0 references
Landweber iteration
0 references
0 references
0 references
0 references
0 references
0.9524777
0 references
0.9291301
0 references
0.9265051
0 references
0.9212426
0 references
0.92034733
0 references
0.9197714
0 references
0.9193649
0 references
