Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243)
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: Computational acceleration of projection algorithms for the linear best approximation problem |
scientific article; zbMATH DE number 5043493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational acceleration of projection algorithms for the linear best approximation problem |
scientific article; zbMATH DE number 5043493 |
Statements
Computational acceleration of projection algorithms for the linear best approximation problem (English)
0 references
4 August 2006
0 references
sequential projection algorithms
0 references
simultaneous projection algorithms
0 references
convex feasibility problem
0 references
numerical examples
0 references
Dykstra's algorithm
0 references
Halpern-Lions-Wittmann-Bauschke algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.89345187
0 references
0.8896303
0 references
0 references
0.88442135
0 references
0 references
0.8798577
0 references
0 references
