On adaptive and non-adaptive stochastic and deterministic algorithms

DOI10.1016/0885-064X(90)90014-5zbMath0712.90074OpenAlexW2022823243MaRDI QIDQ749453

Aleksei G. Sukharev, Olga R. Chuyan

Publication date: 1990

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(90)90014-5

zbMATH Keywords

minimal errorapproximation of operatorsadaptive and nonadaptive stochastic and deterministic algorithmsexistence of generalized saddle points

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Stochastic programming (90C15) Linear operator approximation theory (47A58) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Towards pure adaptive search

Cites Work

• Unnamed Item
• The concept of sequential optimality for problems in numerical analysis
• The equality of errors in classes of passive and sequential algorithms
• The relationship between guaranteed results in sequential and non-sequential algorithms
• Optimal sequential and non-sequential procedures for evaluating a functional
• On the optimality of linear methods for operator approximation in convex classes of functions

This page was built for publication: On adaptive and non-adaptive stochastic and deterministic algorithms