On Projection Algorithms for Solving Convex Feasibility Problems (Q4714414)
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: On Projection Algorithms for Solving Convex Feasibility Problems |
scientific article; zbMATH DE number 941236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Projection Algorithms for Solving Convex Feasibility Problems |
scientific article; zbMATH DE number 941236 |
Statements
On Projection Algorithms for Solving Convex Feasibility Problems (English)
0 references
13 July 1997
0 references
angle between two subspaces
0 references
averaged mapping
0 references
Cimmino's method
0 references
convex inequalities
0 references
convex programming
0 references
convex set
0 references
Fejér monotone sequence
0 references
firmly nonexpansive mapping
0 references
image recovery
0 references
Kaczmarz's method
0 references
nonexpansive mapping
0 references
orthogonal projection
0 references
Slater point
0 references
subdifferential
0 references
subgradient algorithm
0 references
successive projections
0 references
computerized tomography
0 references
convex feasibility problems
0 references
quality of convergence
0 references
0.9027766585350036
0 references
0.8532719612121582
0 references
0.8532688021659851
0 references
0.8530061841011047
0 references
