A nonlinear programming model with implicit variables for packing ellipsoids
From MaRDI portal
Publication:2399478
Recommendations
Cites work
- A box-constrained optimization algorithm with negative curvature directions and spectral projected gradients
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Algorithm 813
- Combining stabilized SQP with the augmented Lagrangian algorithm
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- Global convergence of augmented Lagrangian methods applied to optimization problems with degenerate constraints, including problems with complementarity constraints
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Mathematical model and efficient algorithms for object packing problem
- Minimizing the object dimensions in circle and sphere packing problems
- Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details
- Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. II: Applications to ellipses and ellipsoids
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Optimized ellipse packings in regular polygons
- Optimized object packings using quasi-phi-functions
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Packing circles within ellipses
- Packing congruent hyperspheres into a hypersphere
- Packing ellipsoids by nonlinear optimization
- Packing ellipsoids into volume-minimizing rectangular boxes
- Packing equal circles into a circle with circular prohibited areas
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Practical augmented Lagrangian methods for constrained optimization
- Quasi-phi-functions and optimal packing of ellipses
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
Cited in
(13)- Optimal packing of general ellipses in a circle
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Packing ovals in optimized regular polygons
- Packing ellipsoids in an optimized cylinder
- Packing ellipses in an optimized convex polygon
- Optimized ellipse packings in regular polygons
- Rigorous packing of unit squares into a circle
- Packing ellipsoids with overlap
- Packing ellipsoids by nonlinear optimization
- Packing circles within ellipses
- Packing ellipsoids into volume-minimizing rectangular boxes
- The concept of modeling packing and covering problems using modern computational geometry software
- VOROPACK-D: real-time disk packing algorithm using Voronoi diagram
This page was built for publication: A nonlinear programming model with implicit variables for packing ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399478)