Packing ellipsoids by nonlinear optimization
From MaRDI portal
Publication:312475
DOI10.1007/S10898-015-0395-ZzbMATH Open1377.90088OpenAlexW2218130416MaRDI QIDQ312475FDOQ312475
E. G. Birgin, Rafael D. Lobato, J. M. Martínez
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
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
- The global solver in the LINDO API
- GLOMIQO: global mixed-integer quadratic optimizer
- Algorithm 813
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Title not available (Why is that?)
- A Modeling Language for Mathematical Programming
- Title not available (Why is that?)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Convex Analysis
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Title not available (Why is that?)
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
- Title not available (Why is that?)
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- Quasi-phi-functions and optimal packing of ellipses
- Packing congruent hyperspheres into a hypersphere
- Combining stabilized SQP with the augmented Lagrangian algorithm
- 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
- Geometric properties of random disk packings.
- 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
- Title not available (Why is that?)
- Packing ellipsoids with overlap
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- Uniqueness of supporting hyperplanes and an alternative to solutions of variational inequalities
- Packing equal circles into a circle with circular prohibited areas
- Packing circles within ellipses
- Packing ellipsoids into volume-minimizing rectangular boxes
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Some new bounds for singular values and eigenvalues of matrix products
- Calculating ellipse overlap areas
- Solving circle packing problems by global optimization: numerical results and industrial applications
Cited In (17)
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Geometric Packing under Nonuniform Constraints
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- A nonlinear programming model with implicit variables for packing ellipsoids
- Sparse balanced layout of ellipsoids
- Optimized ellipse packings in regular polygons
- The concept of modeling packing and covering problems using modern computational geometry software
- Packing ellipsoids in an optimized cylinder
- Optimized packing clusters of objects in a rectangular container
- Multistage approach to solving the optimization problem of packing nonconvex polyhedra
- Packing ovals in optimized regular polygons
- Packing ellipses in an optimized convex polygon
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Algorithms of optimal ball packing into ellipsoids
- Rigorous packing of unit squares into a circle
- Two approaches to modeling and solving the packing problem for convex polytopes
- Decomposition Algorithm for Irregular Placement Problems
Uses Software
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)
