Convergence of a class of random search algorithms
From MaRDI portal
Cited in
(8)- On nonsmooth and discontinuous problems of stochastic systems optimization
- Smoothed functional-based gradient algorithms for off-policy reinforcement learning: a non-asymptotic viewpoint
- Newton-based stochastic optimization using \(q\)-Gaussian smoothed functional algorithms
- Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization
- Smoothed functional algorithms for stochastic optimization using q-Gaussian distributions
- Stochastic approximation algorithms: overview and recent trends.
- Truncated Cauchy random perturbations for smoothed functional-based stochastic optimization
- Quasi-maximum likelihood estimation for non-stationary stochastic volatility models: diffuse Kalman filtering approach
This page was built for publication: Convergence of a class of random search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557211)
