Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
From MaRDI portal
Publication:6183083
DOI10.1007/s10898-023-01308-6arXiv2208.11542OpenAlexW4385225555MaRDI QIDQ6183083
Jack Noonan, Anatoly A. Zhigljavsky
Publication date: 26 January 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.11542
global optimizationstochastic optimizationcentral limit theoremspace-fillinglarge dimensionglobal random search
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the worst-case optimal multi-objective global optimization
- Random coverings in several dimensions
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- A space quantization method for numerical integration
- The design and analysis of computer experiments.
- Performance of global random search algorithms for large dimensions
- Pure random search with virtual extension of feasible region
- Efficient quantisation and weak covering of high dimensional cubes
- Covering of high-dimensional cubes and quantization
- Stochastic global optimization.
- Random Euclidean coverage from within
- Kernel techniques: From machine learning to meshless methods
- Convergence properties of stochastic optimization procedures
- Asymptotic quantization error of continuous signals and the quantization dimension
- Minimization by Random Search Techniques
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Bayesian Quadrature, Energy Minimization, and Space-Filling Design
- Bayesian and High-Dimensional Global Optimization
- Non-lattice Covering and Quantization of High Dimensional Sets
- Discrete Energy on Rectifiable Sets
- Scattered Data Approximation