Lower bounds on the convergence rate of the Markov symmetric random search
From MaRDI portal
Publication:2948367
zbMATH Open1330.90064MaRDI QIDQ2948367FDOQ2948367
Publication date: 30 September 2015
Recommendations
- Lower bounds on the convergence rate of the Markov symmetric random search
- On the rate of convergence of one inhomogeneous Markov algorithm of search for extremum
- scientific article; zbMATH DE number 4116313
- Speed of convergence as a function of given accuracy for random search methods
- Optimal Markov monotone symmetric random search
Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Markov and semi-Markov decision processes (90C40)
Cited In (5)
- Optimal Markov monotone symmetric random search
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
- Lower rate of convergence for locating a maximum of a function
- Title not available (Why is that?)
- On the convergence rate issues of general Markov search for global minimum
This page was built for publication: Lower bounds on the convergence rate of the Markov symmetric random search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948367)
