A nonsmooth program for jamming hard spheres
From MaRDI portal
Publication:2439485
DOI10.1007/s11590-012-0566-5zbMath1288.90076arXiv1209.4053OpenAlexW1982601723MaRDI QIDQ2439485
Publication date: 14 March 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.4053
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear programming algorithm to test for jamming in hard-sphere packings
- Predicting the drug release kinetics of matrix tablets
- On the packing of fourteen congruent spheres in a cube
- Unsolved problems in geometry
- Packing up to 50 equal circles in a square
- Improving dense packings of equal disks in a square
- More optimal packings of equal circles in a square
- Dense packings of equal spheres in a cube
- New results in the packing of equal circles in a square
- Geometric properties of random disk packings.
- Rigidity of packings
- Packing of Spheres: Packing of Equal Spheres
- The Markov chain Monte Carlo revolution
- Optimization and nonsmooth analysis
- Derivative-free optimization methods for finite minimax problems
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Triangle distribution and equation of state for classical rigid disks