On adaptive and non-adaptive stochastic and deterministic algorithms

DOI10.1016/0885-064X(90)90014-5MaRDI QIDQ749453zbMATH OpenOpenAlexFDO

Authors Olga R. Chuyan, Aleksei G. Sukharev

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

adaptive and nonadaptive stochastic and deterministic algorithmsapproximation of operatorsexistence of generalized saddle pointsminimal error

Mathematics Subject Classification ID

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

Review text

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.

Recommendations

• Adaptive stochastic approximation algorithm
• Algorithms and adaptivity gaps for stochastic probing
• scientific article; zbMATH DE number 1405930
• scientific article; zbMATH DE number 721880
• scientific article; zbMATH DE number 1043533
• On the almost sure asymptotic behaviour of stochastic algorithm
• scientific article; zbMATH DE number 4200123
• scientific article; zbMATH DE number 3986304
• New stochastic approximation algorithms with adaptive step sizes

Cites work

• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• On the optimality of linear methods for operator approximation in convex classes of functions
• Optimal sequential and non-sequential procedures for evaluating a functional
• 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

Cited in

(6)

• A stochastic analog to Chebyshev centers and optimal average case algorithms
• Towards pure adaptive search
• The cost of deterministic, adaptive, automatic algorithms: cones, not balls
• scientific article; zbMATH DE number 3923972 (Why is no real title available?)
• scientific article; zbMATH DE number 177343 (Why is no real title available?)
• Adaptive algorithm structure: impacts on stability and performance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749453)