Packing ellipsoids by nonlinear optimization
From MaRDI portal
Recommendations
- A nonlinear programming model with implicit variables for packing ellipsoids
- Packing ellipsoids in an optimized cylinder
- Packing ellipsoids into volume-minimizing rectangular boxes
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Optimized ellipse packings in regular polygons
Cites work
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- A Modeling Language for Mathematical Programming
- Algorithm 813
- Calculating ellipse overlap areas
- Combining stabilized SQP with the augmented Lagrangian algorithm
- Convex Analysis
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- Geometric properties of random disk packings.
- 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
- GLOMIQO: global mixed-integer quadratic optimizer
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (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
- Minimizing the object dimensions in circle and sphere packing problems
- 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
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Packing circles within ellipses
- Packing congruent hyperspheres into a hypersphere
- Packing ellipsoids into volume-minimizing rectangular boxes
- Packing ellipsoids with overlap
- 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
- Some new bounds for singular values and eigenvalues of matrix products
- 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.
- The global solver in the LINDO API
- Uniqueness of supporting hyperplanes and an alternative to solutions of variational inequalities
Cited in
(22)- Two approaches to modeling and solving the packing problem for convex polytopes
- Optimal packing of general ellipses in a circle
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Packing ovals in optimized regular polygons
- Packing ellipsoids in an optimized cylinder
- Multistage approach to solving the optimization problem of packing nonconvex polyhedra
- Packing ellipses in an optimized convex polygon
- Optimized packing clusters of objects in a rectangular container
- Optimized ellipse packings in regular polygons
- A nonlinear programming model with implicit variables for packing ellipsoids
- Rigorous packing of unit squares into a circle
- Sparse balanced layout of ellipsoids
- Packing ellipsoids with overlap
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- Geometric Packing under Nonuniform Constraints
- Packing circles within ellipses
- Packing ellipsoids into volume-minimizing rectangular boxes
- Decomposition algorithm for irregular placement problems
- Algorithms of optimal ball packing into ellipsoids
- The concept of modeling packing and covering problems using modern computational geometry software
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
This page was built for publication: Packing ellipsoids by nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312475)
