Packing ellipsoids by nonlinear optimization
From MaRDI portal
Publication:312475
DOI10.1007/s10898-015-0395-zzbMath1377.90088OpenAlexW2218130416MaRDI QIDQ312475
Rafael D. Lobato, José Mario Martínez, Ernesto G. Birgin
Publication date: 15 September 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0395-z
Related Items
Two approaches to modeling and solving the packing problem for convex polytopes, A nonlinear programming model with implicit variables for packing ellipsoids, Packing ovals in optimized regular polygons, Sparse balanced layout of ellipsoids, 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, Decomposition Algorithm for Irregular Placement Problems, Multistage approach to solving the optimization problem of packing nonconvex polyhedra, A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids, Packing ellipses in an optimized convex polygon, Optimized packing clusters of objects in a rectangular container, Optimized ellipse packings in regular polygons
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Quasi-phi-functions and optimal packing of ellipses
- GLOMIQO: global mixed-integer quadratic optimizer
- Uniqueness of supporting hyperplanes and an alternative to solutions of variational inequalities
- Packing congruent hyperspheres into a hypersphere
- Packing ellipsoids into volume-minimizing rectangular boxes
- 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
- Geometric properties of random disk packings.
- Cutting ellipses from area-minimizing rectangles
- Minimizing the object dimensions in circle and sphere packing problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Packing Ellipsoids with Overlap
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- The global solver in the LINDO API
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- 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
- Convex Analysis
- Some new bounds for singular values and eigenvalues of matrix products
- Calculating ellipse overlap areas
