Random-seeking methods for the stochastic unconstrained optimization
From MaRDI portal
Cited in
(5)- Revisiting the ODE method for recursive algorithms: fast convergence using quasi stochastic approximation
- Optimization based on information containing uncertainties
- Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks
- A Kiefer-Wolfowitz algorithm based iterative learning control for Hammerstein-Wiener systems
- Online Statistical Inference for Stochastic Optimization via Kiefer-Wolfowitz Methods
This page was built for publication: Random-seeking methods for the stochastic unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4057454)