Non-lattice Covering and Quantization of High Dimensional Sets
From MaRDI portal
Publication:5153507
DOI10.1007/978-3-030-66515-9_10OpenAlexW3033399774MaRDI QIDQ5153507
Anatoly A. Zhigljavsky, Jack Noonan
Publication date: 30 September 2021
Published in: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.02705
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Efficient quantisation and weak covering of high dimensional cubes ⋮ Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the worst-case optimal multi-objective global optimization
- Design of computer experiments: space filling and beyond
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- Covering of high-dimensional cubes and quantization
- Optimal strategies of the search for an extremum
This page was built for publication: Non-lattice Covering and Quantization of High Dimensional Sets