A nonlinear programming model with implicit variables for packing ellipsoids
From MaRDI portal
Publication:2399478
DOI10.1007/s10898-016-0483-8zbMath1406.90115OpenAlexW2560674158MaRDI QIDQ2399478
Ernesto G. Birgin, Rafael D. Lobato, José Mario Martínez
Publication date: 24 August 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0483-8
Related Items
Packing ovals in optimized regular polygons, Packing ellipsoids in an optimized cylinder, Rigorous packing of unit squares into a circle, The concept of modeling packing and covering problems using modern computational geometry software, A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids, Packing ellipses in an optimized convex polygon, Optimized ellipse packings in regular polygons
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-phi-functions and optimal packing of ellipses
- Packing ellipsoids by nonlinear optimization
- Packing congruent hyperspheres into a hypersphere
- Packing ellipsoids into volume-minimizing rectangular boxes
- 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
- Combining stabilized SQP with the augmented Lagrangian algorithm
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Cutting circles and polygons from area-minimizing rectangles
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Cutting ellipses from area-minimizing rectangles
- Mathematical model and efficient algorithms for object packing problem
- Optimized ellipse packings in regular polygons
- 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
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Optimized Object Packings Using Quasi-Phi-Functions
- Packing equal circles into a circle with circular prohibited areas
- Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
- Packing circles within ellipses
- Algorithm 813
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
