Packing Ellipsoids with Overlap

DOI10.1137/120872309zbMath1282.90124arXiv1204.0235OpenAlexW2071577562MaRDI QIDQ2870609

Stephen J. Wright, Caroline Uhler

Publication date: 21 January 2014

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.0235

zbMATH Keywords

semidefinite programmingtrust-region algorithmellipsoid packingchromosome territories

Mathematics Subject Classification ID

Semidefinite programming (90C22) Numerical optimization and variational techniques (65K10) Cell biology (92C37)

Related Items (8)

Computing the Signed Distance Between Overlapping Ellipsoids ⋮ Packing ellipsoids by nonlinear optimization ⋮ Packing ovals in optimized regular polygons ⋮ Packing ellipsoids into volume-minimizing rectangular boxes ⋮ A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids ⋮ Enumerating Rigid Sphere Packings ⋮ On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container ⋮ Optimized ellipse packings in regular polygons

This page was built for publication: Packing Ellipsoids with Overlap