Numerical shape optimization among convex sets
From MaRDI portal
Abstract: This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate discrete convex shapes and is easily implementable using standard optimization software. The framework can handle various objective functions ranging from geometric quantities to functionals depending on partial differential equations. Width or diameter constraints are handled using the support function. Functionals depending on a convex body and its polar body can be handled using a unified framework.
Recommendations
Cites work
- A Galerkin approach to optimization in the space of convex and compact subsets of \(\mathbb{R}^d\)
- Analytical Parameterization of Rotors and Proof of a Goldberg Conjecture by Optimal Control Theory
- Comparison of approximate shape gradients
- Convergence analysis of Galerkin finite element approximations to shape gradients in eigenvalue optimization
- Convex Bodies The Brunn-MinkowskiTheory
- Handling Convexity-Like Constraints in Variational Problems
- scientific article; zbMATH DE number 4138299 (Why is no real title available?)
- scientific article; zbMATH DE number 50725 (Why is no real title available?)
- scientific article; zbMATH DE number 5044570 (Why is no real title available?)
- Maximal and minimal norm of Laplacian eigenfunctions in a given subdomain
- Minimization of the eigenvalues of the Dirichlet-Laplacian with a diameter constraint
- Minimizing the second eigenvalue of the Laplace operator with Dirichlet boundary conditions
- Minimizing within Convex Bodies Using a Convex Hull Method
- New development in freefem++
- Numerical Approximation of Optimal Convex Shapes
- Numerical minimization of eigenmodes of a membrane with respect to the domain
- Numerical optimization of low eigenvalues of the Dirichlet and Neumann laplacians
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the range of the first two Dirichlet and Neumann eigenvalues of the Laplacian
- On the volume product of planar polar convex bodies — Lower estimates with stability
- Polygons as optimal shapes with convexity constraint
- Semidefinite programming for optimizing convex bodies under width constraints
- Shape variation and optimization. A geometrical analysis
- Shapes and geometries. Metrics, analysis, differential calculus, and optimization
- Variational methods in shape optimization problems
Cited in
(22)- Shape optimization under width constraint
- A Galerkin approach to optimization in the space of convex and compact subsets of \(\mathbb{R}^d\)
- Numerical approximation of optimal convex and rotationally symmetric shapes for an eigenvalue problem arising in optimal insulation
- scientific article; zbMATH DE number 1130740 (Why is no real title available?)
- Numerical Approximation of Optimal Convex Shapes
- Minimizing within Convex Bodies Using a Convex Hull Method
- A Scalable Algorithm for Shape Optimization with Geometric Constraints in Banach Spaces
- The shapes of the future are here!
- Numerical gradients for shape optimization based on embedding domain techniques
- A new numerical approach for solving shape optimization fourth-order spectral problems among convex domains
- Optimal design of sensors via geometric criteria
- On the numerical approximation of Blaschke–Santaló diagrams using Centroidal Voronoi Tessellations
- An improved numerical approach for solving shape optimization problems on convex domains
- Approximation of optimal convex shapes with applications in optimal insulation
- Optimization of Neumann eigenvalues under convexity and geometric constraints
- Shape optimization of polytopes and application to the polyhedral Saint-Venant inequality
- Optimal L^p-approximation of convex sets by convex subsets
- Improved description of Blaschke-Santaló diagrams via numerical shape optimization
- Three quantitative versions of the Pál inequality
- Two-norm discrepancy and convergence of the stochastic gradient method with application to shape optimization
- Blaschke and separation theorems for orthogonal convex sets and some applications
- On a numerical sensitivity approach involving Minkowski deformations for solving shape optimization problems constrained by a semi-linear PDE
This page was built for publication: Numerical shape optimization among convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096947)
