Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092)
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: Subgradient projection algorithms for convex feasibility problems in the presence of computational errors |
scientific article; zbMATH DE number 6342394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subgradient projection algorithms for convex feasibility problems in the presence of computational errors |
scientific article; zbMATH DE number 6342394 |
Statements
Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (English)
0 references
10 September 2014
0 references
approximate solution
0 references
feasibility problem
0 references
Hilbert space
0 references
subgradient projection algorithm
0 references
0 references
0.9518470168113708
0 references
0.9445573687553406
0 references
0.902515709400177
0 references
0.8721076846122742
0 references
