Non-monotoneous parallel iteration for solving convex feasibility problems. (Q5389724)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6026954
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-monotoneous parallel iteration for solving convex feasibility problems. |
scientific article; zbMATH DE number 6026954 |
Statements
23 April 2012
0 references
inherently parallel method
0 references
convex feasibility problem
0 references
projections onto convex set
0 references
slow convergence
0 references
algorithms
0 references
0 references
0 references
0.8714017271995544
0 references
0.8649791479110718
0 references
0.860968828201294
0 references
0.8592542409896851
0 references
0.8568264245986938
0 references
