On adaptive and non-adaptive stochastic and deterministic algorithms (Q749453)
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 adaptive and non-adaptive stochastic and deterministic algorithms |
scientific article; zbMATH DE number 4172765
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On adaptive and non-adaptive stochastic and deterministic algorithms |
scientific article; zbMATH DE number 4172765 |
Statements
On adaptive and non-adaptive stochastic and deterministic algorithms (English)
0 references
1990
0 references
Considered is the problem of approximating an operator with minimal error using adaptive and nonadaptive stochastic and deterministic algorithms. The question of equality of the guaranteed results is analyzed and the existence of generalized saddle points which ensures the required equality both in the deterministic and stochastic case is proved.
0 references
approximation of operators
0 references
minimal error
0 references
adaptive and nonadaptive stochastic and deterministic algorithms
0 references
existence of generalized saddle points
0 references
0 references
0 references
0.8785057
0 references
0.8697022
0 references
0.8586154
0 references
