This article presents a reduced-order modeling methodology via deep convolutional neural networks (CNNs) for shape optimization applications. The CNN provides a nonlinear mapping between the shapes and their associated attributes while conserving the equivariance of these attributes to the shape translations. To implicitly represent complex shapes via a CNN-applicable Cartesian structured grid, a level-set method is employed. The CNN-based reduced-order model (ROM) is constructed in a completely data-driven manner thus well suited for non-intrusive applications. We demonstrate our ROM-based shape optimization framework on a gradient-based three-dimensional shape optimization problem to minimize the induced drag of a wing in low-fidelity potential flow. We show a good agreement between ROM-based optimal aerodynamic coefficients and their counterparts obtained via a potential flow solver. The predicted behavior of the optimized shape is consistent with theoretical predictions. We also present the learning mechanism of the deep CNN model in a physically interpretable manner. The CNN-ROM-based shape optimization algorithm exhibits significant computational efficiency compared to the full-order model-based online optimization applications. The proposed algorithm promises to develop a tractable DL-ROM-driven framework for shape optimization and adaptive morphing structures.
In this article, we present a new data-driven shape optimization approach for implicit hydrofoil morphing via a polynomial perturbation of parametric level set representation. Without introducing any change in topology, the hydrofoil morphing is achieved by six shape design variables associated with the amplitude and shape of the perturbed displacements. The proposed approach has three to four times lower design variables than shape optimization via free-form deformation techniques and almost two orders lower design variables compared to topology optimization via traditional parametric level s…
Deformations of the computational mesh arising from optimization routines usually lead to decrease of mesh quality or even destruction of the mesh. We propose a theoretical framework using pre-shapes to generalize classical shape optimization and calculus. We define pre-shape derivatives and derive according structure and calculus theorems. In particular, tangential directions are featured in pre-shape derivatives, in contrast to classical shape derivatives featuring only normal directions. Techniques from classical shape optimization and -calculus are shown to carry over to this framework. An…
2. In Section 3, we used some vague statements to affirm the training process of the neural network, which cannot support others to reproduce the results of the paper. In addition, this section does not show the difference between this paper and other work, nor does it reflect innovation. 3. In Section 5, the numerical examples are not compared with other multi-resolution methods, which is not enough to explain the superiority of the method proposed in this paper. Figure 10 also fails to show that this method is significantly improved compared to the traditional method. Thanks for your underst…
Shape optimization methods have been proven useful for identifying interfaces in models governed by partial differential equations. Here we consider a class of shape optimization problems constrained by nonlocal equations which involve interface-dependent kernels. We derive a novel shape derivative associated to the nonlocal system model and solve the problem by established numerical techniques.
Shapes do not define a linear space. This paper explores the linear structure of deformations as a representation of shapes. This transforms shape optimization to a variant of optimal control. The numerical challenges of this point of view are highlighted and a novel linear version of the second shape derivative is proposed leading to particular algorithms of shape Newton type.
The differential-geometric structure of the manifold of smooth shapes is applied to the theory of shape optimization problems. In particular, a Riemannian shape gradient with respect to the first Sobolev metric and the Steklov-Poincaré metric are defined. Moreover, the covariant derivative associated with the first Sobolev metric is deduced in this paper. The explicit expression of the covariant derivative leads to a definition of the Riemannian shape Hessian with respect to the first Sobolev metric. In this paper, we give a brief overview of various optimization techniques based on the gradie…
Computational meshes arising from shape optimization routines commonly suffer from decrease of mesh quality or even destruction of the mesh. In this work, we provide an approach to regularize general shape optimization problems to increase both shape and volume mesh quality. For this, we employ pre-shape calculus (cf. arXiv:2012.09124). Existence of regularized solutions is guaranteed. Further, consistency of modified pre-shape gradient systems is established. We present pre-shape gradient system modifications, which permit simultaneous shape optimization with mesh quality improvement. Optimal…
We introduce Fireshape, an open-source and automated shape optimization toolbox for the finite element software Firedrake. Fireshape is based on the moving mesh method and allows users with minimal shape optimization knowledge to tackle with ease challenging shape optimization problems constrained to partial differential equations (PDEs).
Shape optimization with constraints given by partial differential equations (PDE) is a highly developed field of optimization theory. The elegant adjoint formalism allows to compute shape gradients at the computational cost of a further PDE solve. Thus, gradient descent methods can be applied to shape optimization problems. However, gradient descent methods that can be understood as approximation to gradient flows get stuck in local minima, if the optimization problem is non-convex. In machine learning, the optimization in high dimensional non-convex energy landscapes has been successfully tac…
