A Topology-Preserving Level Set Method for Shape Optimization
Oleg Alexandrov, Fadil Santosa
Abstract
The classical level set method, which represents the boundary of the unknown geometry as the zero-level set of a function, has been shown to be very effective in solving shape optimization problems. The present work addresses the issue of using a level set representation when there are simple geometrical and topological constraints. We propose a logarithmic barrier penalty which acts to enforce the constraints, leading to an approximate solution to shape design problems.
Create a lesson
Related papers
Risk-Sensitive Stochastic Optimal Control on Positive Cones
Mohamad Al Ahdab, John-Josef Leth
Deterministic Oracle Complexity for Goldstein Stationarity in Nonsmooth Nonconvex Optimization with Constraints
Yixi Ding, Ya-xiang Yuan
Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds
Adam Pooley, William Warke, Matthew T. Hale
Multi-Step Performance Estimation for Gradient Descent under the Polyak Lojasiewicz Condition
Wanli Hong, Shuyang Ling
Robust Markov Decision Processes: An Introduction Using Convex Optimization and Game Theory
Julien Grand-Clément
Dual-Mode Extremum Seeking for Diffusion Systems with Boundary-Cost Feedback
Martin Guay, Denis Dochain