On Linear Convergence of a Class of Random Search Algorithms
From MaRDI portal
Cited in
(22)- A linear time randomizing algorithm for searching ranked functions
- How to analyse evolutionary algorithms.
- Transition functions for evolutionary algorithms on continuous state-space
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
- scientific article; zbMATH DE number 3862941 (Why is no real title available?)
- Pure random search with exponential rate of convergency
- scientific article; zbMATH DE number 3901926 (Why is no real title available?)
- scientific article; zbMATH DE number 3909649 (Why is no real title available?)
- scientific article; zbMATH DE number 3922395 (Why is no real title available?)
- scientific article; zbMATH DE number 3948002 (Why is no real title available?)
- scientific article; zbMATH DE number 3978836 (Why is no real title available?)
- scientific article; zbMATH DE number 4020863 (Why is no real title available?)
- scientific article; zbMATH DE number 4031420 (Why is no real title available?)
- scientific article; zbMATH DE number 4075001 (Why is no real title available?)
- scientific article; zbMATH DE number 4080680 (Why is no real title available?)
- On the Convergence of the Multidirectional Search Algorithm
- Random Search Algorithms with Sufficient Descent for Minimization of Functions
- On the Optimality of Randomized \alpha-\beta Search
- scientific article; zbMATH DE number 1870008 (Why is no real title available?)
- An inexact linear search and its convergence
- On asymptotic convergence rate of random search
- Optimal order of accuracy of search algorithms in stochastic optimization
This page was built for publication: On Linear 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 Q3824116)
