Numerical Approximation of Optimal Convex Shapes
From MaRDI portal
Methods involving semicontinuity and convergence; relaxation (49J45) Nonsmooth analysis (49J52) Discrete approximations in optimal control (49M25) PDE constrained optimization (numerical aspects) (49M41) Optimization of shapes other than minimal surfaces (49Q10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)
Abstract: This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem. Moreover, we prove the convergence of discretizations in two-dimensional situations. A numerical algorithm is devised that iteratively solves the discrete formulation. Numerical experiments show that optimal convex shapes are generally non-smooth and that three-dimensional problems require an appropriate relaxation of the convexity condition.
Recommendations
Cites work
- Adaptive, anisotropic and hierarchical cones of discrete convex functions
- Automated solution of differential equations by the finite element method. The FEniCS book
- Conforming approximation of convex functions with the finite element method
- Efficient PDE constrained shape optimization based on Steklov-Poincaré-type metrics
- First and Second Order Shape Optimization Based on Restricted Mesh Deformations
- scientific article; zbMATH DE number 1223563 (Why is no real title available?)
- scientific article; zbMATH DE number 1130740 (Why is no real title available?)
- scientific article; zbMATH DE number 2066994 (Why is no real title available?)
- Minimizing within Convex Bodies Using a Convex Hull Method
- NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT
- Numerical Approximation of Optimal Convex Shapes
- Numerical approximation of partial differential equations
- Numerical solution of a nonlinear eigenvalue problem arising in optimal insulation
- On Convex Functions and the Finite Element Method
- OSQP: an operator splitting solver for quadratic programs
- Parametric shape optimization using the support function
- Shape optimization of stationary Navier-Stokes equation over classes of convex domains
- Shapes and geometries. Analysis, differential calculus, and optimization
- Shapes and geometries. Metrics, analysis, differential calculus, and optimization
- Theory and numerics of partial differential equations
- Variational Analysis in Sobolev and BV Spaces
- Variational problems on classes of convex domains.
Cited in
(21)- A Galerkin approach to optimization in the space of convex and compact subsets of \(\mathbb{R}^d\)
- Numerical shape optimization among convex sets
- Parametric shape optimization using the support function
- Numerical approximation of optimal convex and rotationally symmetric shapes for an eigenvalue problem arising in optimal insulation
- Optimal convex shapes for concave functionals
- Polygons as optimal shapes with convexity constraint
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary
- Numerical Approximation of Optimal Convex Shapes
- Minimizing within Convex Bodies Using a Convex Hull Method
- Numerical solution of the Minkowski problem
- Complete systems of inequalities relating the perimeter, the area and the Cheeger constant of planar domains
- A Discretize-then-Optimize Approach to PDE-Constrained Shape Optimization
- An improved numerical approach for solving shape optimization problems on convex domains
- Shape optimization by constrained first-order system least mean approximation
- Approximation of optimal convex shapes with applications in optimal insulation
- Shape optimization of polytopes and application to the polyhedral Saint-Venant inequality
- Numerical techniques for geodesic approximation in Riemannian shape optimization
- Constrained L^p approximation of shape tensors and its role for the determination of shape gradients
- Convergence of a steepest descent algorithm in shape optimisation using \(W^{1\infty}\) functions
- Improved description of Blaschke-Santaló diagrams via numerical shape optimization
- 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 Approximation of Optimal Convex Shapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112548)
