Tensor train solution to uncertain optimization problems with shared sparsity penalty
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911158530736128 |
|---|---|
| author | Antil, Harbir Dolgov, Sergey Onwunta, Akwum |
| author_facet | Antil, Harbir Dolgov, Sergey Onwunta, Akwum |
| contents | We develop both first and second order numerical optimization methods to solve non-smooth optimization problems featuring a shared sparsity penalty, constrained by differential equations with uncertainty. To alleviate the curse of dimensionality we use tensor product approximations. To handle the non-smoothness of the objective function we employ a smoothed version of the shared sparsity objective. We consider both a benchmark elliptic PDE constraint, and a more realistic topology optimization problem in engineering. We demonstrate that the error converges linearly in iterations and the smoothing parameter, and faster than algebraically in the number of degrees of freedom, consisting of the number of quadrature points in one variable and tensor ranks. Moreover, in the topology optimization problem, the smoothed shared sparsity penalty actually reduces the tensor ranks compared to the unpenalised solution. This enables us to find a sparse high-resolution design under a high-dimensional uncertainty. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_03989 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tensor train solution to uncertain optimization problems with shared sparsity penalty Antil, Harbir Dolgov, Sergey Onwunta, Akwum Optimization and Control Numerical Analysis 49J55, 93E20, 49K20, 49K45, 90C15, 65D15, 15A69, 15A23 We develop both first and second order numerical optimization methods to solve non-smooth optimization problems featuring a shared sparsity penalty, constrained by differential equations with uncertainty. To alleviate the curse of dimensionality we use tensor product approximations. To handle the non-smoothness of the objective function we employ a smoothed version of the shared sparsity objective. We consider both a benchmark elliptic PDE constraint, and a more realistic topology optimization problem in engineering. We demonstrate that the error converges linearly in iterations and the smoothing parameter, and faster than algebraically in the number of degrees of freedom, consisting of the number of quadrature points in one variable and tensor ranks. Moreover, in the topology optimization problem, the smoothed shared sparsity penalty actually reduces the tensor ranks compared to the unpenalised solution. This enables us to find a sparse high-resolution design under a high-dimensional uncertainty. |
| title | Tensor train solution to uncertain optimization problems with shared sparsity penalty |
| topic | Optimization and Control Numerical Analysis 49J55, 93E20, 49K20, 49K45, 90C15, 65D15, 15A69, 15A23 |
| url | https://arxiv.org/abs/2411.03989 |