On adaptive and non-adaptive stochastic and deterministic algorithms
From MaRDI portal
(Redirected from Publication:749453)
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)- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- scientific article; zbMATH DE number 177343 (Why is no real title available?)
- A stochastic analog to Chebyshev centers and optimal average case algorithms
- Towards pure adaptive search
- scientific article; zbMATH DE number 3923972 (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)