2020
DOI: 10.1051/cocv/2020015
|View full text |Cite
|
Sign up to set email alerts
|

Null space gradient flows for constrained optimization with applications to shape optimization

Abstract: The purpose of this article is to introduce a gradient-flow algorithm for solving equality and inequality constrained optimization problems, which is particularly suited for shape optimiza- tion applications. We rely on a variant of the ODE approach proposed by Yamashita for equality constrained problems: the search direction is a combina- tion of a null space step and a range space step, aiming to decrease the value of the minimized objective function and the violation of the constraints, respectively. Our fi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 30 publications
(40 citation statements)
references
References 58 publications
0
40
0
Order By: Relevance
“…The constrained shape optimization problem (2.5) is solved thanks to the null space algorithm developed in [44]. The latter calculates a deformation θ of a given shape Γ, such that the value of the objective function J(Γ) is decreased, while ensuring that the constraints g i and h j are "better satisfied".…”
Section: Null Space Gradient Flow Optimization Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…The constrained shape optimization problem (2.5) is solved thanks to the null space algorithm developed in [44]. The latter calculates a deformation θ of a given shape Γ, such that the value of the objective function J(Γ) is decreased, while ensuring that the constraints g i and h j are "better satisfied".…”
Section: Null Space Gradient Flow Optimization Algorithmmentioning
confidence: 99%
“…where γ is a regularization length scale typically set to a few times the mesh element size. In a similar spirit, the transpose T of (3.7) and (3.8) is different from the usual matrix transpose T in (3.3) and (3.4), see section 2.1 in [44] for the mathematical definition. 2.…”
Section: Null Space Gradient Flow Optimization Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…All the involved finite element computations are performed within the FreeFem++ environment [39] -whether they are related to the resolution of the physical system (4.1) or to that of our variational problem (4.9). The resolution of the constrained optimization program (4.2) is carried out by the discretization of a specific gradient flow in the spirit of [56], see the details of our algorithm in our recent work [37]. When it comes to representing shapes and their evolution in the course of the iterative resolution of (4.2), the level set based mesh evolution method of [4,36] is used, as a convenient combination of the "classical" level set method for shape and topology optimization [2,61] and the mmg open-source mesh modification algorithm [21].…”
Section: Shape Optimization Of Linearly Elastic Structuresmentioning
confidence: 99%
“…The algorithm can be seen as a null-space gradient method, see e.g. [33,4]. It has been described in [6] without proof of convergence; its local convergence has been proven in [9].…”
Section: 3mentioning
confidence: 99%