On the rate of convergence of one inhomogeneous Markov algorithm of search for extremum
From MaRDI portal
(Redirected from Publication:357763)
Recommendations
- scientific article; zbMATH DE number 4116313
- On the convergence rate of the Markov homogeneous monotone optimization method
- Lower bounds on the convergence rate of the Markov symmetric random search
- Lower bounds on the convergence rate of the Markov symmetric random search
- scientific article; zbMATH DE number 4080680
Cites work
- scientific article; zbMATH DE number 4108054 (Why is no real title available?)
- scientific article; zbMATH DE number 3422187 (Why is no real title available?)
- Expected number of steps of a random optimization method
- Introduction to Stochastic Search and Optimization
- Monotonous random search on a torus: integral upper bounds for the complexity
- Optimal Markov monotone symmetric random search
- Rates of Convergence for a Class of Global Stochastic Optimization Algorithms
- Speed of convergence as a function of given accuracy for random search methods
- Stochastic global optimization.
- Theoretical framework for comparing several stochastic optimization approaches
Cited in
(13)- Search schemes for random optimization algorithms that preserve the asymptotic distribution
- Lower bounds on the convergence rate of the Markov symmetric random search
- Lower bounds on the convergence rate of the Markov symmetric random search
- On asymptotic convergence rate of random search
- scientific article; zbMATH DE number 4031420 (Why is no real title available?)
- scientific article; zbMATH DE number 4116313 (Why is no real title available?)
- On the convergence of markovian stochastic algorithms with rapidly decreasing ergodicity rates
- Optimal order of accuracy of search algorithms in stochastic optimization
- On the convergence rate of the Markov homogeneous monotone optimization method
- On the complexity of the search of an extremum of a function
- On the convergence rate issues of general Markov search for global minimum
- On the convergence of inhomogeneous Markov chains approximating equilibrium placements of flexible objects
- Convergence of a random algorithm for function optimization
This page was built for publication: On the rate of convergence of one inhomogeneous Markov algorithm of search for extremum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q357763)