Progressive global random search of continuous functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3176450 (Why is no real title available?)
- A Sequential Method Seeking the Global Maximum of a Function
- Adaptive Global Search by the Process of Competitive Evolution
- On the Convergence of Statistical Search
- Optimization Strategies in Adaptive Control: A Selective Survey
- Ordered risk minimization. I
- Ordered risk minimization. II
- Probability Inequalities for Sums of Bounded Random Variables
- Properties of the random search in global optimization
- Random optimization
- Some experiments in global optimization
- Statistical learning methods based on teacher identification
- Training procedures which combine stochastic approximation and minimization of the empirical risk
Cited in
(14)- Semiparametric statistical inference in global random search
- Random tunneling by means of acceptance-rejection sampling for global optimization
- Improvement of pure random search in global optimization
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- Global convergence of the stochastic tâtonnement process
- Convergence qualification of adaptive partition algorithms in global optimization
- A global minimization algorithm for Lipschitz functions
- Stochastic Methods for Global Optimization
- Alternative sampling strategy for a random optimization algorithm
- A decision model and methodology for the AIDS epidemic
- Machine learning for optimal blackjack counting strategies
- État de l'art des méthodes “d'optimisation globale”
- Approximate implementations of pure random search in the presence of noise
- Stochastic global optimization methods part I: Clustering methods
This page was built for publication: Progressive global random search of continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168393)
