Covering of high-dimensional cubes and quantization
From MaRDI portal
Publication:2225655
DOI10.1007/s43069-020-0015-8zbMath1453.90131arXiv2002.06118OpenAlexW3049568112MaRDI QIDQ2225655
Anatoly A. Zhigljavsky, Jack Noonan
Publication date: 8 February 2021
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.06118
Nonconvex programming, global optimization (90C26) Numerical methods for mathematical programming, optimization and variational techniques (65K99) Acceleration of convergence in numerical analysis (65B99)
Related Items (5)
Efficient quantisation and weak covering of high dimensional cubes ⋮ Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ Non-lattice Covering and Quantization of High Dimensional Sets ⋮ Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing Sobol Sequences with Better Two-Dimensional Projections
- On the worst-case optimal multi-objective global optimization
- Design of computer experiments: space filling and beyond
- Random coverings in several dimensions
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- On-line covering a cube by a sequence of cubes
- On-line covering the unit cube by cubes
- Foundations of Data Science
This page was built for publication: Covering of high-dimensional cubes and quantization