Binary Level Set Method for Topology Optimization of Variational Inequalities

Abstract : The paper is concerned with the topology optimization of the elliptic variational inequalities using the level set approach. The standard level set method is based on the description of the domain boundary as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton-Jacobi equation. In the paper a binary level set method is used to represent sub-domains rather than the standard method. The binary level set function takes at convergence value 1 in each sub domain of a whole design domain and $$-1$$ outside this sub domain. The sub domains interfaces are represented by discontinuities of these functions. Using a two-phase approximation and a binary level set approach the original structural optimization problem is reformulated as an equivalent constrained optimization problem in terms of this level set function. Necessary optimality condition is formulated. Numerical examples are provided and discussed.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01286414
Contributor : Hal Ifip <>
Submitted on : Thursday, March 10, 2016 - 5:17:36 PM
Last modification on : Friday, December 1, 2017 - 1:12:48 AM
Document(s) archivé(s) le : Sunday, November 13, 2016 - 3:18:32 PM

File

978-3-662-45504-3_19_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Andrzej Myśliński. Binary Level Set Method for Topology Optimization of Variational Inequalities. 26th Conference on System Modeling and Optimization (CSMO), Sep 2013, Klagenfurt, Austria. pp.199-209, ⟨10.1007/978-3-662-45504-3_19⟩. ⟨hal-01286414⟩

Share

Metrics

Record views

47

Files downloads

35