Related papers: Parametric Shape Optimization using the Support Fu…
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…
Optimization of convex functions subject to eigenvalue constraints is intriguing because of peculiar analytical properties of eigenvalues, and is of practical interest because of wide range of applications in fields such as structural…
We provide a general framework to construct finite dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies. We give estimates…
In this paper we prove that solutions to several shape optimization problems in the plane, with a convexity constraint on the admissible domains, are polygons. The main terms of the shape functionals we consider are either E f ($\Omega$),…
Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…
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.…
We focus here on the analysis of the regularity or singularity of solutions $\Om_{0}$ to shape optimization problems among convex planar sets, namely: $$ J(\Om_{0})=\min\{J(\Om),\ \Om\ \textrm{convex},\ \Omega\in\mathcal S_{ad}\}, $$ where…
In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…
A computer-assisted proof is proposed for the Laplacian eigenvalue minimization problems over triangular domains under diameter constraints. The proof utilizes recently developed guaranteed computation methods for both eigenvalues and…
In this article it is shown that the equilateral triangle maximizes the Cheeger constant and minimizes the torsional rigidity among shapes having a fixed minimal width. The proof techniques use direct comparisons with simpler shapes,…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
In typical applications of Bayesian optimization, minimal assumptions are made about the objective function being optimized. This is true even when researchers have prior information about the shape of the function with respect to one or…
We present a general numerical approach to shape optimization with state constraints for 2-dimensional geometries, without relaxing the constraints. To do this we reformulate the problem on a fixed reference domain using a conformal…
We study a shape optimization problem associated with the first eigenvalue of a nonlinear spectral problem involving a mixed operator ($p-$Laplacian and Laplacian) with a constraint on the volume. First, we prove the existence of a…
We are interested in the question of stability in the field of shape optimization, with focus on the strategy using second order shape derivative. More precisely, we identify structural hypotheses on the hessian of the considered shape…
Given a convex set $\Omega$ of $\mathbb{R}^n$, we consider the shape optimization problem of finding a convex subset $\omega\subset \Omega$, of a given measure, minimizing the $p$-distance functional $$\mathcal{J}_p(\omega) :=…
We consider a shape optimization problem for the persistence threshold of a biological species dispersing in a periodically fragmented environment, the unknown shape corresponding to the portion of the habitat which is favorable to the…
We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…
This paper settles the existence question for a rather general class of convex optimal design problems with a volume constraint. In low dimensions, we prove the existence of an optimal configuration for general convex minimization problems…