Progressive global random search of continuous functions
From MaRDI portal
Publication:4168393
DOI10.1007/BF01609037zbMath0387.90083MaRDI QIDQ4168393
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Improvement of pure random search in global optimization, État de l'art des méthodes “d'optimisation globale”, Random tunneling by means of acceptance-rejection sampling for global optimization, Stochastic Methods for Global Optimization, Stochastic global optimization methods part I: Clustering methods, A global minimization algorithm for Lipschitz functions, Convergence qualification of adaptive partition algorithms in global optimization, A decision model and methodology for the AIDS epidemic, Machine learning for optimal blackjack counting strategies, Efficient computation of the Hausdorff distance between polytopes by exterior random covering, Global convergence of the stochastic tâtonnement process, Alternative sampling strategy for a random optimization algorithm, Semiparametric statistical inference in global random search, Approximate implementations of pure random search in the presence of noise
Cites Work
- Unnamed Item
- Properties of the random search in global optimization
- Ordered risk minimization. I
- Ordered risk minimization. II
- Random optimization
- Statistical learning methods based on teacher identification
- Training procedures which combine stochastic approximation and minimization of the empirical risk
- Optimization Strategies in Adaptive Control: A Selective Survey
- Adaptive Global Search by the Process of Competitive Evolution
- On the Convergence of Statistical Search
- Probability Inequalities for Sums of Bounded Random Variables
- A Sequential Method Seeking the Global Maximum of a Function
- Some experiments in global optimization
