Saved in:
Bibliographic Details
Main Authors: Dambrine, Marc, Geiersbach, Caroline, Harbrecht, Helmut
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2408.05021
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909282732081152
author Dambrine, Marc
Geiersbach, Caroline
Harbrecht, Helmut
author_facet Dambrine, Marc
Geiersbach, Caroline
Harbrecht, Helmut
contents The present article is dedicated to proving convergence of the stochastic gradient method in case of random shape optimization problems. To that end, we consider Bernoulli's exterior free boundary problem with a random interior boundary. We recast this problem into a shape optimization problem by means of the minimization of the expected Dirichlet energy. By restricting ourselves to the class of convex, sufficiently smooth domains of bounded curvature, the shape optimization problem becomes strongly convex with respect to an appropriate norm. Since this norm is weaker than the differentiability norm, we are confronted with the so-called two-norm discrepancy, a well-known phenomenon from optimal control. We therefore need to adapt the convergence theory of the stochastic gradient method to this specific setting correspondingly. The theoretical findings are supported and validated by numerical experiments.
format Preprint
id arxiv_https___arxiv_org_abs_2408_05021
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Two-norm discrepancy and convergence of the stochastic gradient method with application to shape optimization
Dambrine, Marc
Geiersbach, Caroline
Harbrecht, Helmut
Optimization and Control
The present article is dedicated to proving convergence of the stochastic gradient method in case of random shape optimization problems. To that end, we consider Bernoulli's exterior free boundary problem with a random interior boundary. We recast this problem into a shape optimization problem by means of the minimization of the expected Dirichlet energy. By restricting ourselves to the class of convex, sufficiently smooth domains of bounded curvature, the shape optimization problem becomes strongly convex with respect to an appropriate norm. Since this norm is weaker than the differentiability norm, we are confronted with the so-called two-norm discrepancy, a well-known phenomenon from optimal control. We therefore need to adapt the convergence theory of the stochastic gradient method to this specific setting correspondingly. The theoretical findings are supported and validated by numerical experiments.
title Two-norm discrepancy and convergence of the stochastic gradient method with application to shape optimization
topic Optimization and Control
url https://arxiv.org/abs/2408.05021