Optimal coverage of convex regions

DOI10.1007/BF00939828zbMath0581.90074OpenAlexW2042029127MaRDI QIDQ1068722

Reuven Y. Rubinstein, Gennady Samorodnitsky

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939828

zbMATH Keywords

nonconvex programminginequality constraintsMonte Carlo optimizationminimal volumeconvex hullspolygonscoverage of convex regionshyperellipsoidminimal covering hyperspherequadratic configurations

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Computing a global optimal solution to a design centering problem

Cites Work

• Unnamed Item
• Generating random vectors uniformly distributed inside and on the surface of different regions
• A stochastic method for global optimization
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Convex Analysis

This page was built for publication: Optimal coverage of convex regions