On geometric convergence rate of Markov search towards the fat target
From MaRDI portal
Publication:2417043
DOI10.1016/j.orl.2017.10.016OpenAlexW2767376176MaRDI QIDQ2417043
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2017.10.016
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonautonomous stochastic search in global optimization
- Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
- Evolution strategies. A comprehensive introduction
- On the convergence rate issues of general Markov search for global minimum
- Nonautonomous stochastic search for global minimum in continuous optimization
- Monotonous random search on a torus: integral upper bounds for the complexity
- Stochastic global optimization.
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
- Convergence properties of stochastic optimization procedures
- Real Analysis and Probability
- On the convergence rate of the Markov homogeneous monotone optimization method
This page was built for publication: On geometric convergence rate of Markov search towards the fat target