Method for constructing optimal dark coverings

DOI10.1134/S0965542518070084zbMath1490.60033OpenAlexW2888415580MaRDI QIDQ1991636

Georgy K. Kamenev

Publication date: 30 October 2018

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542518070084

zbMATH Keywords

global optimizationapproximationmathematical modelingfractal dimensioncoveringslocal optimization\(\epsilon\)-capacity\(\epsilon\)-netsdeep holes method\(\epsilon\)-entropypure global searchrandom multistartShannon \((\epsilon, \delta)\)-netsupport of a random variable

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Fractals (28A80) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Approximation of completely bounded sets by the deep holes method.
• Interactive decision maps. Approximation and visualization of Pareto frontier
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• Study of convergence rate and efficiency of two-phase methods for approximating the Edgeworth-Pareto hull
• Numerical methods for finding global extrema (Case of a non-uniform mesh)