Pages that link to "Item:Q357763"
From MaRDI portal
The following pages link to On the rate of convergence of one inhomogeneous Markov algorithm of search for extremum (Q357763):
Displaying 10 items.
- Optimal order of accuracy of search algorithms in stochastic optimization (Q749450) (← links)
- A Metropolis-type optimization algorithm on the infinite tree (Q1277371) (← links)
- Speed of convergence as a function of given accuracy for random search methods (Q1321574) (← links)
- On the convergence rate issues of general Markov search for global minimum (Q1685583) (← links)
- Lower bounds on the convergence rate of the Markov symmetric random search (Q2839424) (← links)
- On the convergence of markovian stochastic algorithms with rapidly decreasing ergodicity rates (Q4238141) (← links)
- Convergence of a random algorithm for function optimization (Q4943324) (← links)
- Search schemes for random optimization algorithms that preserve the asymptotic distribution (Q4944551) (← links)
- On the convergence rate of the Markov homogeneous monotone optimization method (Q5438131) (← links)
- On the convergence of inhomogeneous Markov chains approximating equilibrium placements of flexible objects (Q5938474) (← links)
